Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix

Linear Algebra and Its Applications

Volumn 371, Issue SUPPL., 2003, Pages 1-30

  Schwetlick, Hubert ^a   Schnabel, Uwe ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Bordered systems; Generalized inverse iteration; Generalized Rayleigh quotient; Singular values; Singular vectors

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTER SIMULATION; ITERATIVE METHODS; NONLINEAR EQUATIONS;

SINGULAR VALUES;

MATRIX ALGEBRA;

EID: 0042591429     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(03)00490-7     Document Type: Article

References (23)

1. Allgower E.L., Schwetlick H. A general view of minimally extended systems for simple bifurcation points. Z. Angew. Math. Mech. 77:1997;83-97.
2. Bai Z., Demmel J., Dongarra J., Ruhe A., Van der Vorst H. Templates for the Solution of Algebraic Eigenvalue Problems. A Practical Guide. 2000;SIAM, Philadelphia.
3. Barrett R., Berry M., Chan T.F., Demmel J., Donato J., Dongarra J., Eijkhout V., Pozo R., Romine C., Van der Vorst H. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. 1993;SIAM, Philadelphia.
4. Björck Å. Numerical Methods for Least Squares Problems. 1996;SIAM, Philadelphia.
5. Bramble J.H., Knyazev A.V., Pasciak J.E. A subspace preconditioning algorithm for eigenvector/eigenvalue computation. Adv. Comput. Math. 6:1996;159-189.
6. Chan T.F. Deflated decomposition of solutions of nearly singular systems. SIAM J. Numer. Anal. 21:1984;738-754.
7. Dai R.X., Rheinboldt W.C. On the computation of manifolds of foldpoints for parameter-dependent problems. SIAM J. Numer. Anal. 27:1990;437-446.
8. Golub G.H., Van Loan C.F. Matrix Computations. third ed. 1996;Johns Hopkins University Press, Baltimore.
9. Golub G.H., Ye Q. Inexact inverse iteration for generalized eigenvalue problems. BIT. 40:2000;671-684.
10. Govaerts W. Computation of singularities in large nonlinear systems. SIAM J. Numer. Anal. 34:1997;867-880.
11. Griewank A., Reddien G.W. Characterization and computation of generalized turning points. SIAM J. Numer. Anal. 21:1984;176-185.
12. Hochstenbach M. A Jacobi-Davidson type SVD method. SIAM J. Sci. Comput. 23:2001;606-628.
13. Keller H.B. Numerical solution of bifurcation and nonlinear eigenvalue problems. Rabinowitz P.H. Applications of Bifurcation Theory. 1977;359-384 Academic Press, New York.
14. Lai Y.-L., Lin K.-Y., Lin W.-W. An inexact inverse iteration for large sparse eigenvalue problems. Numer. Linear Algebra Appl. 4:1997;425-437.
15. Lui S.H. Computation of pseudospectra by continuation. SIAM J. Sci. Comput. 18:1997;565-573.
16. Paige C.C., Saunders M.A. Algorithm 583 LSQR: Sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8:1982;195-209.
17. Pönisch G., Schnabel U., Schwetlick H. Computing multiple pitchfork bifurcation points. Computing. 59:1997;209-222.
18. Schleiff S., Schwetlick H. Characterization and computation of period doubling points by minimally extended systems. Optim. Methods Softw. 8:1997;1-24.
19. U. Schnabel, Berechnung singulärer Punkte nichtlinearer Gleichungssysteme, Dissertation (PhD Thesis), Fakultät Mathematik u. Naturwissenschaften, Fachrichtung Mathematik, Techn. Univers. Dresden, Germany, 2000.
20. Sleijpen G.L.G., Van der Vorst H.A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17:1996;401-425.
21. Smit P., Paardekooper M.H.C. The effects of inexact solvers in algorithms for symmetric eigenvalue problems. Linear Algebra Appl. 287:1999;337-357.
22. Trefethen L.N., Bau D. Numerical Linear Algebra. 1997;SIAM, Philadelphia.
23. Van Huffel S., Vandewalle J., Haegemans A. An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values. J. Comput. Appl. Math. 19:1987;313-330.