The singular value decomposition in multivariate statistics
ACM SIGNUM NewsletterPublished 1 July 1985
Sven Hammarling
Citations18
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
To Gene Golub who has done so much to encourage and advance the use of stable numerical techniques in multivariate statistics.
Keywords
MathematicsEngineering
The algebraic eigenvalue problem
5,785 Citations1965J. H. Wilkinson
Introduction to matrix computations
2,396 Citations1973G. W. Stewart
Rounding-Error Analysis of Solution of Triangular Systems and of Gaussian Elimination.
Journal of the Society for Industrial and Applied Mathematics Series B Numerical AnalysisCalculating the Singular Values and Pseudo-Inverse of a Matrix
1,773 Citations1965Gene H. Golub, W. Kahan
The use of the pseudo-inverse $A^I = V\Sigma ^I U^* $ to solve least squares problems in a way which dampens spurious oscillation and cancellation is mentioned.
SIAM Journal on Numerical AnalysisAn Analysis of the Total Least Squares Problem
1,727 Citations1980Gene H. Golub, Charles F. Van Loan
An algorithm for solving the TLS problem is proposed that utilizes the singular value decomposition and which provides a measure of the underlying problem''s sensitivity.
Society for Industrial and Applied Mathematics eBooksLINPACK Users' Guide
1,726 Citations1979Jack Dongarra, C Moler +2 more
General matrices Band matrices positive definite matrices Positive definite band matrices Symmetric Indefinite Matrices Triangular matrices Tridiagonal matrices The Cholesky decomposition The QR decomposition up to and including the singular value decomposition is studied.
IEEE Transactions on Automatic ControlThe singular value decomposition: Its computation and some applications
1,571 Citations1980Virginia Klema, Alan J. Laub
This work provides a tutorial introduction to certain numerical computations both in linear algebra and linear systems in the context of bounded arithmetic and the singular value decomposition (SVD).
Numerische MathematikNumerical methods for solving linear least squares problems
838 Citations1965Gene H. Golub
This paper considers stable numerical methods for handling linear least squares problems that frequently involve large quantities of data, and they are ill-conditioned by their very nature.
Mathematics of ComputationNumerical methods for computing angles between linear subspaces
789 Citations1973Åke Björck, Gene H. Golub
Experimental results are given, which indicates that MGS gives $\theta_k$ with equal precision and fewer arithmetic operations than HT, however, HT gives principal vectors, which are orthogonal to working accuracy, which is not in general true for MGS.
SIAM Journal on Numerical AnalysisGeneralizing the Singular Value Decomposition
648 Citations1976Charles F. Van Loan
SIAM Journal on Numerical AnalysisTowards a Generalized Singular Value Decomposition
547 Citations1981Christopher C. Paige, Michael A. Saunders
SIAM ReviewOn the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
415 Citations1977G. W. Stewart
Updating Formulae and a Pairwise Algorithm for Computing Sample Variances
203 Citations1982Tony F. Chan, Gene H. Golub +1 more
A general formula is presented for computing the simple variance for a sample of size m + n given the means and variances for two subsamples of sizes m and n, used in the construction of a pairwise algorithm for Computing the variance.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Rank degeneracy and least squares problems
175 Citations1976Gene H. Golub, Virginia Klema +1 more
SIAM Journal on Scientific and Statistical ComputingComputing the Generalized Singular Value Decomposition
138 Citations1986Christopher C. Paige
With the correct choice of ordering the algorithm can be implemented using systolic array processors (Gentleman, personal communication), and can also be used to compute any CS decomposition of a unitary matrix.
Elsevier eBooksMATRIX DECOMPOSITIONS AND STATISTICAL CALCULATIONS††This work was in part supported by the National Science Foundation and Office of Naval Research.
128 Citations1969Gene H. Golub
Communications of the ACMUpdating mean and variance estimates
119 Citations1979David West
Evidence is presented that the method is stable and at least as accurate as the best existing updating method for updating weighted sampled data.
SIAM Journal on Numerical AnalysisFast Numerically Stable Computations for Generalized Linear Least Squares Problems
79 Citations1979Christopher C. Paige
An algorithm based on plane rotations which is designed for fast computation, especially for large structured problems, and can be made to handle any rank deficiency in the matrices is made.
Journal of the American Statistical AssociationA Constrained Least Squares Approach to the General Gauss-Markov Linear Model
67 Citations1981Stavros Kourouklis, Christopher C. Paige
Communications of the ACMComputing standard deviations
46 Citations1979Tony F. Chan, John G. Lewis
Four algorithms for the numerical computation of the standard deviation of (unweighted) sampled data are analyzed and it is concluded that all four algorithms will provide accurate answers for many problems, but two of the algorithms are substantially more accurate on difficult problems than are the other two.
Communications in Statistics - Simulation and ComputationNumerically stable computations for general univariate linear models
43 Citations1978C.C. aige
IMA Journal of Numerical AnalysisThe Least Squares Solution of Overdetermined Linear Equations Having Band or Augmented Band Structure
41 Citations1981M G Cox
Linear Algebra and its ApplicationsThe general linear model and the generalized singular value decomposition
34 Citations1985Christopher C. Paige
ACM Transactions on Mathematical SoftwareAlgorithm 581: An Improved Algorithm for Computing the Singular Value Decomposition [F1]
27 Citations1982Tony F. Chan
The improved a lgor i thm first computes the QR factorizat ion of A using Householder t ransformat ions, and then uses the Go lub -Re insch a l Igor i Thm on R to solve the SSVDC problem.
Journal of the Operational Research SocietyComputational Methods for Data Analysis
5 Citations1979S. D. Grove
Open access LMU (Ludwid Maxmilian's Universitat Munchen)The General Linear Model and the Generalized Singular Value Decomposition
3 Citations2009Leo Knüsel