Modified gram-schmidt process vs. classical gram-schmidt

DOI10.1080/03610918108812227MaRDI QIDQ3914322zbMATH OpenOpenAlexFDO

Authors James W. Longley

Publication date 1981

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918108812227

zbMATH Keywords

Gram-Schmidt orthogonalizationmodified Gram-Schmidtnumerical stabilityside statistics

Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25)

Cites work

• Elimination with weighted row combinations for solving linear equations and least squares problems
• scientific article; zbMATH DE number 3678917 (Why is no real title available?)
• Solving linear least squares problems by Gram-Schmidt orthogonalization

Cited in

(6)

• Numerics of Gram-Schmidt orthogonalization
• A comparison of algorithms for forming the QR decomposition for use in regression
• Some investigations on convergence of GMRES in solving BEM equations for slender beam structures
• Gram-Schmidt orthogonalization: 100 years and more
• scientific article; zbMATH DE number 1138082 (Why is no real title available?)
• Column-Wise Modified Gram-Schmidt

This page was built for publication: Modified gram-schmidt process vs. classical gram-schmidt

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914322)