121. Collapsed Adjacency Matrices, Character Tables And Ramanujan Graphs A database of character tables of endomorphism rings. http://www.math.rwth-aachen.de/~Ines.Hoehler/

Collapsed Adjacency Matrices, Character Tables and Ramanujan Graphs This is a database of character tables of endomorphism rings. Let G be a finite group, K a field and M a finite set on which G acts transitively. For a in M let M ,...,M r be the distinct orbits of G a , which have respective representatives a =a, a ,..., a r . Let E i i [k,l] be the collapsed adjacency matrix for the orbital digraph (M,E i ). Therefore A i is defined as the number of neighbours of a k in M l (see PrSoi for details). Let R denote the endomorphism ring End KG ,...,S k The entries of a column of the character table are the eigenvalues of the corresponding orbital digraph (see PrSoi for details). (see CePoTeTrVe for details). For rank up to 5 the collapsed adjacency matrices have been computed by Cheryl E. Praeger and Leonard H. Soicher (PrSoi) . Several matrices (also for larger rank cases) can be found in IvLiLuSaSoi , where numerous further references are given.) The following matrices originally have been published in: LLS : Fi with 2 .M Soi : Co with 2 .O IM : J with 2 .M Nor : M with 2.BM.

122. IFILM - Shorts The Matrices In The matrices, a Keanuesque actor discovers that he s in an indie film, and he must face the challenge of saying his lines correctly, as well as saving http://www.ifilm.com/ifilmdetail/2463710

123. The Test Matrix Toolbox Contains a collection of test matrices, routines for visualizing matrices, and miscellaneous routines that provide useful additions to MATLAB's existing set of functions. http://www.ma.man.ac.uk/~higham/testmat.html

The Test Matrix Toolbox The Test Matrix Toolbox (last release, 1995) has been superseded by the The Matrix Computation Toolbox (first release, 2002). Most of the test matrices in Test Matrix Toolbox have been incorporated into MATLAB in the gallery function. The new toolbox incorporates some of the other routines in the Test Matrix Toolbox (in some cases renamed) and adds several new ones.

124. Hermitian Matrices Returning to Hermitian matrices, we can also show that they possess another Hermitian matrices have found an important application in modern physics, http://www.mathpages.com/home/kmath306/kmath306.htm

Hermitian Matrices Given a matrix A of dimension m k (where m denotes the number of rows and k denotes the number of columns) and a matrix B of dimension k n, the matrix product AB is defined as the m n matrix with the components for m ranging from 1 to m and for n ranging from 1 to n. Notice that matrix multiplication is not generally commutative, i.e., the product AB is not generally equal to the product BA. The transpose A T of the matrix A is defined as the k m matrix with the components for m ranging from 1 to m and for k ranging from 1 to k. Notice that transposition is distributive, i.e., we have (A+B) T = (A T + B T Combining the preceding definitions, the transpose of the matrix product AB has the components Hence we've shown that We can also define the complex conjugate A of the matrix A as the m k matrix with the components Notice that the matrix A can be written as the sum A R + iA I where A R and A I are real valued matrices. The complex conjugate of A can then be written in the form We also note that transposition and complex conjugation are commutative, i.e., we have (A T = (A T . Hence the composition of these two operations (in either order) gives the same result, called the

125. Multivariate Analyses Fortran 90 codes for univariate and multivariate random number generation, computation of simple statistics, covariance matrices, principal components analysis, multiple regression, and jacknife crossvalidation, by Dan Hennen. http://www.esg.montana.edu/eguchi/multivariate/#Fortran

Environmental Analyses (BIOL 505, Spring 2002) Montana State University, Bozeman Class hours: Monday/Wednesday/Friday 14:10 - 15:00 Last modified: Fri Mar 15 11:46:16 MST 2002 This is the homepage for Biology 505, Spring 2002 (D. Goodman). This page will contain lecture notes, examples of programs (FORTRAN, Matlab, Java, and C), and any other relevant information to Dr. Goodman's lecture. For any suggestions and questions regarding this homepage, please email Tomo Eguchi Index: Contact Information Additional Information Lecture Notes Programming ... Data Contact Information: Dan Goodman: goodman@rivers.oscs.montana.edu Tomo Eguchi: eguchi@montana.edu Dan Hennen: hennen@torrent.msu.montana.edu Nicole Wagner: nwagner@montana.edu Eric Ward: eward@montana.edu Matt Rinella: mrinella@montana.edu Additional information: Here are some books and other additional papers/summary that are relevant to the class (in a random order): Multivariate Analysis , K. V. V. Mardia, J. T. Kent, and J. M. Bibby. Academic Press, 1980. (Recommended by Dr. Goodman) Applied Linear Statistical Models , J. Neter, M. H. Kutner, C. J. Nachtsheim, and W. Wasserman. IRWIN, 1996.

126. PlanetMath: Hermitian Matrix The real symmetric matrices are a subspace of the Hermitian matrices. Hermitian matrices are also called selfadjoint since if $ A$ is Hermitian, http://planetmath.org/encyclopedia/HermitianMatrix.html

(more info) Math for the people, by the people. Encyclopedia Requests Forums Docs ... Random Login create new user name: pass: forget your password? Main Menu sections Encyclop¦dia Papers Books Expositions meta Requests Orphanage Unclass'd Unproven ... Classification talkback Polls Forums Feedback Bug Reports downloads Snapshots PM Book information News Docs Wiki ChangeLog ... About Hermitian matrix (Definition) For a matrix , let , where is the transpose , and is the complex conjugate of Definition A complex square matrix is Hermitian , if Properties The eigenvalues of a Hermitian matrix are real The diagonal elements of a Hermitian matrix are real The complex conjugate of a Hermitian matrix is a Hermitian matrix. If is a Hermitian matrix, and is a complex matrix of same dimension as , then is a Hermitian matrix. A matrix is symmetric if and only if it is real and Hermitian. Hermitian matrices is a vector subspace in the vector space of complex matrices. The real symmetric matrices are a subspace of the Hermitian matrices. Hermitian matrices are also called self-adjoint since if is Hermitian, then in the usual

127. Supported Clusters Research on clusters and nanosystems has the general aim of understanding the properties of matter at small sizes (typically less than 1000 atoms) and its interaction with surfaces. Novel methods are developed to produce and characterize clusters and nanosystems free or deposited on surfaces and in matrices. http://ipn2.epfl.ch/GPAS/

Welcome to the web site of the Cluster and Nanosystems Group at the Institute of Physics of Nanostructures at EPFL Research on clusters and nanosystems has the general aim of understanding the properties of matter at small sizes (typically less than 1000 atoms) and its interaction with surfaces. Novel methods are developed to produce and characterize clusters and nanosystems free or deposited on surfaces and in matrices. Postal address: Institut de Physique des Nanostructures FSB EPFL (École Polytechnique Fédérale de Lausanne) CH-1015 Lausanne Switzerland Phone: +41 21 693 3320, Fax: +41 21 693 3604

128. Raven Standard Progressive Matrices The Standard Progressive matrices (SPM) was designed to measure a person’s ability to form perceptual relations and to reason by analogy...... http://www.cps.nova.edu/~cpphelp/RSPM.html

Raven Standard Progressive Matrices Purpose: Designed to measure a person’s ability to form perceptual relations. Population: Ages 6 to adult. Score: Percentile ranks. Time: (45) minutes. Author: J.C. Raven. Publisher: U.S. Distributor: The Psychological Corporation. Description: The Standard Progressive Matrices (SPM) was designed to measure a person’s ability to form perceptual relations and to reason by analogy independent of language and formal schooling, and may be used with persons ranging in age from 6 years to adult. It is the first and most widely used of three instruments known as the Raven's Progressive Matrices, the other two being the Coloured Progressive Matrices (CPM) and the Advanced Progressive Matrices (APM). All three tests are measures of Spearman's g. Scoring: Reliability: Internal consistency studies using either the split-half method corrected for length or KR20 estimates result in values ranging from .60 to .98, with a median of .90. Test-retest correlations range from a low of .46 for an eleven-year interval to a high of .97 for a two-day interval. The median test-retest value is approximately .82. Coefficients close to this median value have been obtained with time intervals of a week to several weeks, with longer intervals associated with smaller values. Raven provided test-retest coefficients for several age groups: .88 (13 yrs. plus), .93 (under 30 yrs.), .88 (30-39 yrs.), .87 (40-49 yrs.), .83 (50 yrs. and over). Validity: Spearman considered the SPM to be the best measure of g. When evaluated by factor analytic methods which were used to define g initially, the SPM comes as close to measuring it as one might expect. The majority of studies which have factor analyzed the SPM along with other cognitive measures in Western cultures report loadings higher than .75 on a general factor. Concurrent validity coefficients between the SPM and the Stanford-Binet and Weschler scales range between .54 and .88, with the majority in the .70s and .80s.

129. MATLAB Version Of The UF Sparse Matrix Collection Provide a simple method for downloading sparse test matrices from real applications into MATLAB. http://www.cise.ufl.edu/research/sparse/mat

Tim Davis , Assoc. Prof. Room E338 CSE Building P.O. Box 116120 University of Florida Gainesville, FL 32611-6120 phone (352) 392-1481, fax (352) 392-1220 email: davis AT cise.ufl.edu MATLAB version of the UF sparse matrix collection An easy MATLAB interface to the UF sparse matrix collection The UFget package provides a simple MATLAB interface to the UF sparse matrix collection. Typing Problem = UFget ('HB/arc130') for example, will get the matrix of that name from the UF sparse matrix collection, save it in a local directory on your own computer, and then load it into MATLAB. The second time you load the matrix, the previously downloaded copy is used instead. Typing UFget alone prints out a list of available matrices and their characteristics. The matrix format is described in the README file for the MATLAB-format version of the UF sparse matrix collection. Click here for the UF Sparse Matrix Collection in Harwell/Boeing format Click here for a list of all matrices in the collection and their attributes back to Tim Davis' home page back to the sparse matrix research page Directories of the MATLAB version of the UF sparse matrix collection: Click on a directory below. To download a matrix, right click a compressed (*.mat.gz) file and select "save as...".

130. National Weather Service: Grand Rapids, MI: Area Forecast Matrix: AFMGRR 000 FOUS53 KGRR 102013 AFMGRR AREA FORECAST matrices NATIONAL WEATHER SERVICE GRAND RAPIDS MI 334 PM EDT WED AUG 10 2005 MIZ037111045- MASON- INCLUDING THE http://www.crh.noaa.gov/product.php?site=grr&product=AFMGRR&format=ci

131. The RRGIBBS Home Page Fortran 95 codes by Karin Meyer RRGIBBS does simple random regression analyses via Gibbs sampling, and PDMATRIX makes matrices positive definite. http://agbu.une.edu.au/~kmeyer/rrg_main.html

Introduction Random regression (RR) models have become a popular choice for the analysis of longitudinal data or 'repeated' records. Typically, analyses require numerous parameters, i.e. (co)variances between RR coefficients and measurement error variances, to be estimated, especially if the model of analysis includes additional random effects such as maternal effects. Programs for RR model analysis using restricted maximum likelihood (REML) are available. However, the high computational demands of REML analyses for RR models severely limit the feasibility of RR analyses for data sets sufficiently large to support estimation of the pertaining (co)variance components, in particular for models fitting many RR coefficients. Bayesian analyses using Gibbs sampling provide an alternative which is markedly simpler to implement than REML. Whilst the range of models which can be accommodated via Gibbs sampling may be more restrictive and the total computing time required may be longer than for corresponding REML analyses, memory requirements are substantially less. Hence Bayesian methodology readily facilitates large scale analyses. Apart from these practical advantages, of course, it provides estimates of complete sampling distributions rather than just simple point estimates. Purpose RRGIBBS performs a single task : the analysis of a simple class of RR models using Bayesian methodology. Models may involve

132. Intertwining Matrices relative rotation rates and intertwining matrices directly from templates. For reference we present a few of these intertwining matrices below. http://www.drchaos.net/drchaos/Book/node159.html

Next: Horseshoe Up: Knots and Templates Previous: General Algorithm Intertwining Matrices With the rules learned in the previous section we can now calculate relative rotation rates and intertwining matrices directly from templates. For reference we present a few of these intertwining matrices below. Horseshoe Lorenz Nicholas B. Tufillaro Mon Mar 3 01:58:02 PST 1997

133. NTL: A Library For Doing Number Theory A highperformance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields. http://www.shoup.net/ntl/

NTL: A Library for doing Number Theory NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields. A Tour of NTL Download NTL Trouble-shooting guide Contact Info and Mailing Lists ... Related Links Now available: NTL 5.4 [More detailed information about recent changes] Back to Victor Shoup's Home Page

134. D-MATH - Workshop On Random Matrices And Other Random Objects On the physical side, random matrices appear in several new developments, in particular in Laplacian growth problems, YangMills theory and string theory, http://www.math.ethz.ch/u/felder/Research/RandomMatrices

Contact Sitemap Help Search ETH Zurich D-MATH Giovanni Felder Research ... Links Workshop on Random Matrices and Other Random Objects FIM, ETH Zurich 17-21 May 2005 This workshop is dedicated to new developments in random matrix theory, random partitions and related topics in physics and mathematics. On the physical side, random matrices appear in several new developments, in particular in Laplacian growth problems, Yang-Mills theory and string theory, that raise several mathematical questions. On the mathematics side, several powerful techniques, based on the Riemann-Hilbert problem, discretization, and large deviations, have been introduced. The workshop aims at a fruitful exchange of ideas and different points of view in this subject. Organizers: Alberto Cattaneo, Giovanni Felder, Thomas Kappeler Sponsors: FIM , EU network ENIGMA , ESF programme MISGAM Programme of the conference with slides of selected talks, Registration: Please register for the conference with the online registration form Financial Support: Limited partial financial support is available for European participants. Priority will be given to young researchers. You may apply for financial support on the

135. Peter M Neumann The Queen's College, University of Oxford. Varieties of groups; finite permutation groups; infinite permutation groups; design of grouptheoretic algorithms; soluble groups; quantitative topics in group theory; matrices over finite fields; miscellaneous questions in combinatorics, geometry and general group theory; history of group theory. Chairman of the UK Mathematics Trust. http://www.maths.ox.ac.uk/~neumann/

Dr Peter M Neumann Tel: 01865 279178 Fax: 01865 790819 Email: peter.neumann@queens.ox.ac.uk Personal details Research Recent publications Personal Fellow and Praelector in Mathematics at The Queen's College , since 1966 and Lecturer (CUF) in the University of Oxford since 1967; visiting lecturer or visiting professor at various times at various universities in many parts of the world. In Queen's I teach all branches of pure mathematics to undergraduates. For the University I lecture to undergraduates and graduate students on anything of interest to myself and, I hope, to them; I also supervise MSc and DPhil students in any area related to my own research. So far 30 students have completed doctorates under my supervision. For the three academic years October 1995 to September 1998 I was seconded half-time to Staff Development to help with University Teacher Training within Oxford. Other positions include: Chairman of the United Kingdom Mathematics Trust (UKMT) ; Vice-President of the British Society for History of Mathematics (BSHM) ; Editor of London Mathematical Society Monographs (published for the Society by OUP); editor of

136. TI-92 Help - Matrices You can also enter matrices using the Data/Matrix Editor application. matrices may have real or complex entries as shown on the screen at the right. http://www.math.montana.edu/frankw/ccp/help/TI92/matrices/text.htm

TI-92 Help Matrices Entering a matrix from the home screen Entering a matrix using the Data/Matrix editor The elements of a matrix Adding matrices ... The determinant of a matrix The simplest way to enter a matrix into the TI-92 is shown in the screen at the right. Note: Each row is enclosed in square brackets with the entries separated by commas. All the rows are enclosed in another set of square brackets but the rows are not separated by commas The screen at the right shows another way of entering a matrix. Using this second method all the entries are listed enclosed by one set of square brackets. The entries in each row are seperated by commas and the rows are seperated by semicolons. You can also enter matrices using the Data/Matrix Editor application. Matrices may have real or complex entries as shown on the screen at the right. The screen at the right shows how to access a particular entry in a matrix. We can add two matrices in the obvious way as shown in the screen at the right. We can multiply a matrix by a scalar in the obvious way as shown in the screen at the right.

137. Analysis Of Incomplete Datasets: Estimation Of Mean Values And Covariance Matric A regularized expectationmaximization (EM) algorithm for the estimation of mean values and covariance matrices and for the imputation of missing values in large, incomplete datasets. http://www.gps.caltech.edu/~tapio/imputation/

Analysis of incomplete datasets: Estimation of mean values and covariance matrices and imputation of missing values Purpose Installation Module descriptions Possible modifications Purpose What follows is a collection of Matlab modules for the estimation of mean values and covariance matrices from incomplete datasets, and the imputation of missing values in incomplete datasets. The modules implement the regularized EM algorithm described in T. Schneider, 2001: Analysis of incomplete climate data: Estimation of mean values and covariance matrices and imputation of missing values Journal of Climate The EM algorithm for Gaussian data is based on iterated linear regression analyses. In the regularized EM algorithm, ridge regression with generalized cross-validation replaces the conditional maximum likelihood estimation of regression parameters in the conventional EM algorithm. The implementation of the regularized EM algorithm is modular, so that the modules that perform the ridge regression and the generalized cross-validation can be exchanged for other regularization methods and other methods of determining a regularization parameter. Per-Christian Hansen's Regularization Tools contain Matlab modules implementing a collection of regularization methods that can be adapted to fit into the framework of the EM algorithm. The generalized cross-validation modules of the regularized EM algorithm are adapted from Hansen's generalized cross-validation modules.

138. Matrices: Basic Definitions Matrix Multiplication To multiply 2 matrices, they need to be of appropriate And now practice multiplying matrices; if the multiplication CAN be carried http://www.math.csusb.edu/math110/src/matrices/basics.html

Matrices: Basic Definitions and Operations A matrix is an array of entries ; in our case these entries wll be numbers. Matrices come in all possible rectangular shapes, the following are a number of examples of matrices: In general, we denote a matrix by Each a ij is called an element of the matrix (or an entry of the matrix ); this denotes the element in row i and column j . The entries of the matrix are organized in horizontal rows and vertical columns The size , or dimension , of the matrix is n x m , where n is the number of rows of the matrix, and m is the number of column of the matrix. For example , the matrices above are of dimensions , and respectively. A special kind of matrix is a square matrix , i.e. a matrix with the same number of rows and columns. If a square matrix has n rows and n columns, we say that the matrix has order n . Square matrices also have a special set of entries: those on the diagonal from top left to bottom right. This diagonal is called the principal , or main diagonal , and its elements are called the principal , or main diagonal elements Example The matrix is a square matrix of order , and its main diagonal elements are , and The Algebra of Matrices In some circumstances, it is possible to carry out arithmetic operations with matrices; we describe these here.

139. Fast Statistical Methods Page Fortran 90 and 77 codes by W.H. Press and G.B. Rybicki, for fast inversion matrices of an exponential form arising from autocorrelation functions of OrnsteinUhlenbeck processes. http://www.lanl.gov/DLDSTP/fast/

Keywords (for robots): time series statistical methods Wiener filter optimal filters filtering linear prediction interpolation covariance matrix correlation function structure function exponential decay inverse of tridiagonal matrix Gaussian random process fast method order N methods least squares fitting Gauss-Markov unbiased low-frequency red pink noise random walk fractal This page is maintained by George Rybicki ( rybicki@cfa.harvard.edu ) and Bill Press ( wpress@cfa.harvard.edu ), as a location for our links to the subject, and as a distribution point for our source code that implements so-called "fast" statistical methods. We define "fast" methods as being methods that seem to require the inversion of a matrix the size of the data set (typically the covariance matrix S+N ), an n workload but actually can be done, thanks to special assumptions or approximations, in order n workload We are interested in fast methods because they are applicable to very large data sets, and because they provide an efficient and well-controlled alternative to various inferior and ad-hoc procedures for the interpolation or fitting of noisy, incomplete data sets. Our Publications Our principal published work on this subject is in PRL

140. Formulas Y Teoremas De Matematica Y Estadistica Compilado de la asignatura de matem¡ticas y estad­stica. Incluye derivadas, integrales, matrices y distribuciones de probabilidad. http://cablemodem.fibertel.com.ar/coya/formulas/

Fórmulas y Teoremas de Estadística Menú MATEMATICAS ESTADISTICA LINKS MAPA DEL SITIO CONTACTAME Este sitio intenta brindar información útil para el estudio. Su contenido es una compilación de fórmulas, teoremas y definiciones matemáticas (algebra y calculo) y estadísticas. Entre los diversos temas que abarca se incluye tablas de derivadas e integrales, estudio de funciones, matrices y determinantes; probabilidad y distribuciones. Contador gratuito

Page 7     121-140 of 190    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 10  | Next 20