TOPICS
Search

Search Results for ""


601 - 610 of 1049 for Unimodular MatrixSearch Results
Let lambda be (possibly complex) eigenvalues of a set of random n×n real matrices with entries independent and taken from a standard normal distribution. Then as n->infty, ...
The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...
The Heisenberg group H^n in n complex variables is the group of all (z,t) with z in C^n and t in R having multiplication (w,t)(z,t^')=(w+z,t+t^'+I[w^*z]) (1) where w^* is the ...
A one-person game played on a rectangular lattice of lamps which can be turned on and off. A move consists of flipping a "switch" inside one of the squares, thereby toggling ...
Linear algebra is the study of linear sets of equations and their transformation properties. Linear algebra allows the analysis of rotations in space, least squares fitting, ...
The term metric signature refers to the signature of a metric tensor g=g_(ij) on a smooth manifold M, a tool which quantifies the numbers of positive, zero, and negative ...
A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...
Let A_r=a_(ij) be a sequence of N symmetric matrices of increasing order with i,j=1, 2, ..., r and r=1, 2, ..., N. Let lambda_k(A_r) be the kth eigenvalue of A_r for k=1, 2, ...
Covariance provides a measure of the strength of the correlation between two or more sets of random variates. The covariance for two random variates X and Y, each with sample ...
A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...
1 ... 58|59|60|61|62|63|64 ... 105 Previous Next

...