论文信息 - Numerical aspects of gram-schmidt orthogonalization of vectors - 字舞流文

Numerical aspects of gram-schmidt orthogonalization of vectors

[1] Youcef Saad,et al. Projection methods for solving large sparse eigenvalue problems , 1983 .

[2] Axel Ruhe. The two-sided arnoldi algorithm for nonsymmetric eigenvalue problems , 1983 .

[3] Y. Saad. The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems , 1982 .

[4] Michael A. Saunders,et al. Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems , 1982, TOMS.

[5] Michael A. Saunders,et al. LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[6] Y. Saad. Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices , 1980 .

[7] Axel Ruhe,et al. The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems , 1980 .

[8] G. Stewart,et al. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .

[9] Å. Björck. Solving linear least squares problems by Gram-Schmidt orthogonalization , 1967 .

[10] Åke Björck. Iterative refinement of linear least squares solutions I , 1967 .

[11] J. Gillis,et al. Matrix Iterative Analysis , 1961 .