The decompositional approach to matrix computation
- 1 January 2000
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 2 (1), 50-59
- https://doi.org/10.1109/5992.814658
Abstract
The introduction of matrix decomposition into numerical linear algebra revolutionized matrix computations. The article outlines the decompositional approach, comments on its history, and surveys the six most widely used decompositions: Cholesky decomposition; pivoted LU decomposition; QR decomposition; spectral decomposition; Schur decomposition; and singular value decomposition.Keywords
This publication has 37 references indexed in Scilit:
- A Divide-and-Conquer Algorithm for the Bidiagonal SVDSIAM Journal on Matrix Analysis and Applications, 1995
- Computing the Generalized Singular Value DecompositionSIAM Journal on Scientific Computing, 1993
- An updating algorithm for subspace trackingIEEE Transactions on Signal Processing, 1992
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972
- Calculating the Singular Values and Pseudo-Inverse of a MatrixJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1The Computer Journal, 1961
- Householder's Method for the Solution of the Algebraic EigenproblemThe Computer Journal, 1960
- Über die charakteristischen Wurzeln einer linearen Substitution mit einer Anwendung auf die Theorie der IntegralgleichungenMathematische Annalen, 1909
- Über ein leichtes Verfahren die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen*).Journal für die reine und angewandte Mathematik (Crelles Journal), 1846