Abstract
Round off error analysis for the classical Gram-Schmidt orthogonalization method with re-orthogonalization is presented. The effect of the round-off error on the orthogonality of the derived vectors and also on the solution of the linear least squares problems when solved by the Gram-Schmidt algorithm are given. Numerical results compared favorably with the results of other methods. The classical case when no re-orthogonalization takes place is also discussed.
Similar content being viewed by others
References
Å. Björck,Solving Linear Least Squares Problems by Gram Schmidt Orthogonalization, BIT 7 (1967), 1–21.
G. Forsythe and C.B. Moler,Computer Solution of Linear Algebraic Systems, Prentice Hall Inc. Englewood Cliffs, N.J., 1967.
G. Golub,Numerical Methods for Solving Linear Least Squares Problems, Numer. Math. 7 (1965), 206–216.
T.L. Jordan,Experiments on Error Growth Associated with Some Linear Least Squares Procedures, Math. Comp. 21 (1968), 579–588.
W. C. Mitchell and D. L. McCraith,Heuristic Analysis of Numerical Variants of the Gram Schmidt Orthonormalization Process, T.R. No. CS 122, Computer Science Department, Stanford University, AD 687450 (1969).
C. C. Paige,Practical Use of the Symmetric Lanczos Process with Re-Orthogonalization, BIT 10 (1970), 183–195.
J. R. Rice,Experiments on Gram Schmidt Orthogonalization, Math. Comp. 20 (1966), 325–328.
J. H. Wilkinson,The Algebraic Eigenvalue Problem, Clarendon Press, Oxford 1965.
J. H. Wilkinson,Rounding Errors in Algebraic Processes, Prentice Hall, Inc., N.J., 1963.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Abdelmalek, N.N. Round off error analysis for Gram-Schmidt method and solution of linear least squares problems. BIT 11, 345–367 (1971). https://doi.org/10.1007/BF01939404
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01939404