A robust criterion for the modified Gram-Schmidt algorithm with selective reorthogonalization

SIAM Journal on Scientific Computing

Volumn 25, Issue 2, 2003, Pages 417-441

  Giraud, Luc ^a   Langou, Julien ^a  

^a CERFACS   (France)

Author keywords

Gram Schmidt algorithm with selective reorthogonalization

Indexed keywords

ALGORITHMS; COSTS; ERROR ANALYSIS; ITERATIVE METHODS; PROBLEM SOLVING; VECTORS;

COMPUTATIONAL COSTS; GRAM-SCHMIDT ALGORITHM WITH SELECTIVE REORTHOGONALIZATION;

MATRIX ALGEBRA;

EID: 2342635201     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S106482750340783X     Document Type: Conference Paper

References (17)

1. E. SCHMIDT, Uber die Auflösung linearer Gleichungen mit unendlich vielen Unbekannten, Rend. Circ. Mat. Palermo Ser. 1, 25 (1908), pp. 53-77.
2. J. H. WILKINSON, Hounding Errors in Algebraic Processes, Prentice-Hall, Englewood Cliffs, NJ, 1963.
3. J. R. RICE, Experiments on Gram-Schmidt orthogonalization, Math. Comp., 20 (1966), pp. 325-328.
4. A. BJÖRCK, Solving linear least squares problems by Gram-Schmidt orthogonalization, BIT, 7 (1967), pp. 1-21.
5. H. RUTISHAUSER, Description of ALGOL 60, in Handbook for Automatic Computation, Vol. 1, Part a, F. L. Bauer, A. S. Householder, F. W. J. Olver, H. Rutishauser, K. Samelson, and E. Stiefel, eds., Springer-Verlag, New York, 1967, pp. 220-221.
6. J. M. VARAH, A lower bound for the smallest singular value of a matrix, Linear Algebra Appl., 11 (1975), pp. 3-5.
7. J. W. DANIEL, W. B. GRAGG, L. KAUFMAN, AND G. W. STEWART, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-795.
8. W. GANDER, L. MOLINARI, AND H. ŠVECOVÁ, Numerische Prozeduren aus Nachlass und Lehre von Prof. Heinz Rutishauser, Internat. Ser. Numer. Math. 33, Birkhäuser-Verlag, Basel, Stuttgart, 1977.
9. W. GANDER, Algorithms for the QR Decomposition, Research report 80-02, Eidgenössische Technische Hochschule, Zürich, 1980.
10. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
11. A. RUHE, Numerical aspects of Gram-Schmidt orthogonalization of vectors, Linear Algebra Appl., 52/53 (1983), pp. 591-601.
12. W. HOFFMANN, Iterative algorithms for Gram-Schmidt orthogonalization, Computing, 41 (1989), pp. 335-348.
13. L. REICHEL AND W. B. GRAGG, FORTRAN subroutines for updating the QR decomposition, ACM Trans. Math. Software, 16 (1990), pp. 369-377.
14. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
15. N. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
16. V. FRAYSSÉ, L. GIRAUD, AND S. GRATTON, A Set of GMRES Routines for Real and Complex Arithmetics, Tech. report TR/PA/97/49, CERFACS, Toulouse, France, 1997.
17. L. GIRAUD, J. LANGOU, AND M. ROZLOŽNÍK, On the Round-off Error Analysis of the Gram-Schmidt Algorithm with Reorthogonalization, Tech. report TR/PA/02/33, CERFACS, Toulouse, France, 2002.