Results 1  10
of
262
An iterative method for the solution of the eigenvalue problem of linear differential and integral
, 1950
"... The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the ..."
Abstract

Cited by 537 (0 self)
 Add to MetaCart
The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through
REGIONS OF EXCLUSION FOR THE LATENT ROOTS OF A MATRIX
"... The wellknown Theorem 0 is due to S. Gersgorin [2] and A. ..."
NOTE ON THE IMPROVEMENT OF APPROXIMATE LATENT ROOTS AND MODAL COLUMNS OF A SYMMETRICAL MATRIX
, 1954
"... The method given below for the improvement of an approximate set of latent roots and modal columns of a symmetrical matrix is essentially the same as Jahn's second method described in (1), but the proof is here set out entirely in matrix notation. The present paper is, in fact, the counterpart ..."
Abstract
 Add to MetaCart
The method given below for the improvement of an approximate set of latent roots and modal columns of a symmetrical matrix is essentially the same as Jahn's second method described in (1), but the proof is here set out entirely in matrix notation. The present paper is, in fact, the counterpart
Printed in Great Britain Testing the equality of the smallest latent roots of a correlation matrix
"... The asymptotic variance of a statistic used to test the equality of the smallest latent roots of a correlation matrix is computed. This permits an approximation to its null distribution suggested by Lawley (1956). A simulation is used to compare the performance of this approximation with others curr ..."
Abstract
 Add to MetaCart
The asymptotic variance of a statistic used to test the equality of the smallest latent roots of a correlation matrix is computed. This permits an approximation to its null distribution suggested by Lawley (1956). A simulation is used to compare the performance of this approximation with others
IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORY
, 1947
"... A method is described for simultaneously improving all the latent roots and modal columns of a given matrix, starting from a given complete set of approximate modal columns. It is considered that the method will be useful as a final step in any iteration process of determining these quantities. The ..."
Abstract
 Add to MetaCart
A method is described for simultaneously improving all the latent roots and modal columns of a given matrix, starting from a given complete set of approximate modal columns. It is considered that the method will be useful as a final step in any iteration process of determining these quantities
CRANIOFACIAL RECONSTRUCTION AS A PREDICTION PROBLEM USING A LATENT ROOT REGRESSION MODEL
, 2012
"... Abstract. In this paper, we present a computerassisted method for facial reconstruction. This method provides an estimation of the facial shape associated with unidentified skeletal remains. Current computerassisted methods using a statistical framework rely on a common set of extracted points loc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
located on the bone and softtissue surfaces. Most of the facial reconstruction methods then consist in predicting the position of the softtissue surface points, when the positions of the bone surface points are known. We propose to use Latent Root Regression for prediction. The results obtained
Contract No. AFOSR68l4l5 and the Sakkokai Foundation. ON THE DISTRIBUTION OF THE LATENT ROOTS OF A COMPLEX WISHART MATRIX (NONCENTRAL CASE)
"... This paper considers the derivation of the probability density function of the latent roots of a noncentral complex Wishart matrix. To treat this problem, we define the generalized Hermite polynomials of a complex matrix argument and give some properties of the generalized Hermite polynomials. By u ..."
Abstract
 Add to MetaCart
This paper considers the derivation of the probability density function of the latent roots of a noncentral complex Wishart matrix. To treat this problem, we define the generalized Hermite polynomials of a complex matrix argument and give some properties of the generalized Hermite polynomials
Institute of Statistics Mimeo Series No. 619A TABLE OF PERCENTAGE POINTS OF THE SMALLEST LATENT ROOT OF A 2 x 2 WISHART MATRIX
"... The letter t ..."
Printed in Great Britain
"... Bayesian estimation of latent roots and vectors with special reference to the bivariate normal distribution ..."
Abstract
 Add to MetaCart
Bayesian estimation of latent roots and vectors with special reference to the bivariate normal distribution
Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators
, 2005
"... Eigenvalues, latent roots, proper values, characteristic values—four synonyms for a set of numbers that provide much useful information about a matrix or operator. A huge amount of research has been directed at the theory of eigenvalues (localization, perturbation, canonical forms,...), at applicat ..."
Abstract

Cited by 189 (13 self)
 Add to MetaCart
Eigenvalues, latent roots, proper values, characteristic values—four synonyms for a set of numbers that provide much useful information about a matrix or operator. A huge amount of research has been directed at the theory of eigenvalues (localization, perturbation, canonical forms
Results 1  10
of
262