Gram‐Schmidt orthogonalization: 100 years and more. Issue 3 (4th June 2012)

• Record Type: Journal Article
• Authors: Leon, Steven J.; Björck, Åke; Gander, Walter
• Is Part Of: Numerical linear algebra with applications. Volume 20:Issue 3(2013:May)
• Page Start: 492
• Page End: 532
• Publication Date: 2012-06-04
• Subjects: Algebras, Linear -- Periodicals; 512.5
• DOI: 10.1002/nla.1839
• Languages: English
• ISSNs: 1070-5325

Abstract

<abstract abstract-type="main" id="nla1839-abs-0001"> <title>SUMMARY</title> <p>In 1907, Erhard Schmidt published a paper in which he introduced an orthogonalization algorithm that has since become known as the classical Gram‐Schmidt process. Schmidt claimed that his procedure was essentially the same as an earlier one published by J. P. Gram in 1883. The Schmidt version was the first to become popular and widely used. An algorithm related to a modified version of the process appeared in an 1820 treatise by P. S. Laplace. Although related algorithms have been around for almost 200 years, it is the Schmidt paper that led to the popularization of orthogonalization techniques. The year 2007 marked the 100th anniversary of that paper. In celebration of that anniversary, we present a comprehensive survey of the research on Gram‐Schmidt orthogonalization and its related QR factorization. Its application for solving least squares problems and in Krylov subspace methods are also reviewed. Software and implementation aspects are also discussed. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p> </abstract>