Updating the singular value decomposition

Journal of Computational and Applied Mathematics

Volumn 170, Issue 1, 2004, Pages 145-167

  Davies, Philip I ^a   Smith, Matthew I ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Hadamard products; Jacobi's algorithm; Kogbetliantz's algorithm; Singular value decomposition; Skew symmetric matrices

Indexed keywords

COMPUTATIONAL METHODS; DECOMPOSITION; PROBLEM SOLVING;

DIAGONAL ELEMENTS; SINGULAR VALUE DECOMPOSITION;

MATRIX ALGEBRA;

MATHEMATICAL METHOD;

EID: 3042692212     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2003.12.039     Document Type: Article

References (17)

1. Bai Z. Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition Linear Algebra Appl. 104 1988 131-140
2. Charlier J.P. Van Dooren P. On Kogbetliantz's SVD algorithm in the presence of clusters Linear Algebra Appl 95 1987 135-160
3. Charlier J.P. Vanbegin M. Van Dooren P. On efficient implementation of Kogbetliantz's algorithm for computing the singular value decomposition Numer. Math. 52 1988 279-300
4. Collar A.R. Some notes on Jahn's method for the improvement of approximate latent roots and vectors of a square matrix Quart. J. Mech. Appl. Math. 1 1948 145-148
5. Davies R.O. Modi J.J. A direct method for completing eigenproblem solutions on a parallel computer Linear Algebra Appl. 77 1986 61-74
6. Eisenstat S.C. Ipsen I.C.F. Relative perturbation techniques for singular value problems SIAM J. Numer. Anal. 32 6 1995 1972-1988
7. Fierro R.D. Perturbation theory for two-sided (or complete) orthogonal decompositions SIAM J. Matrix Anal. Appl. 17 1996 383-400
8. Forsythe G.E. Henrici P. The cyclic Jacobi method for computing the principal values of a complex matrix Trans. Amer. Math. Soc. 94 1960 1-23
9. Golub G.H. Van Loan C.F. Matrix Computations 3rd Edition 1996 Johns Hopkins University Press Baltimore, MD, USA
10. Horn R.A. Johnson C.R. Topics in Matrix Analysis 1991 Cambridge University Press Cambridge, UK
11. Jahn H.A. Improvement of an approximate set of latent roots and modal columns of a matrix by methods akin to those of classical perturbation theory Quart. J. Mech. Appl. Math. 1 1948 131-144
12. Kanzow C. Nagel C. Semidefinite programs: new search directions, smoothing type methods, and numerical results SIAM J. Optim. 13 1 2002 1-23
13. Kogbetliantz E.G. Solution of linear equations by diagonalization of coefficient matrix Quart. Appl. Math. 13 1955 123-132
14. Paige C.C. Van Dooren P. On the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition Linear Algebra Appl. 77 1986 301-313
15. Parlett B.N. The Symmetric Eigenvalue Problem 1998 Society for Industrial and Applied Mathematics Philadelphia, PA, USA
16. Stewart G.W. Error and perturbation bounds for subspaces associated with certain eigenvalue problems SIAM Rev. 15 1973 727-764
17. Wedin P.-Å. Perturbation bounds in connection with singular value decomposition BIT 12 1 1972 99-111