A note on the error analysis of classical Gram–Schmidt
暂无分享,去创建一个
[1] G. Stewart,et al. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .
[2] Walter Gander,et al. Algorithms for the QR-Decomposition , 2003 .
[3] Gene H. Golub,et al. Matrix computations , 1983 .
[4] A. Kiełbasiński. Analiza numeryczna algorytmu ortogonalizacji Grama-Schmidta , 1974 .
[5] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .
[6] Julien Langou,et al. A Robust Criterion for the Modified Gram-Schmidt Algorithm with Selective Reorthogonalization , 2003, SIAM J. Sci. Comput..
[7] Hasan Erbay,et al. Improved Gram–Schmidt Type Downdating Methods , 2005 .
[8] Gene H. Golub,et al. Matrix Computations, Third Edition , 1996 .
[9] Michael L. Overton,et al. Numerical Computing with IEEE Floating Point Arithmetic , 2001 .
[10] Å. Björck. Solving linear least squares problems by Gram-Schmidt orthogonalization , 1967 .
[11] Julien Langou,et al. Rounding error analysis of the classical Gram-Schmidt orthogonalization process , 2005, Numerische Mathematik.
[12] J. Navarro-Pedreño. Numerical Methods for Least Squares Problems , 1996 .
[13] Walter Hoffmann,et al. Iterative algorithms for Gram-Schmidt orthogonalization , 1989, Computing.
[14] Julien Langou,et al. ROBUST SELECTIVE GRAM-SCHMIDT REORTHOGONALIZATION , 2002 .
[15] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .