Gram-Schmidt orthogonalization: 100 years and more

作者: Steven J. Leon , Åke Björck , Walter Gander

DOI: 10.1002/NLA.1839

关键词:

摘要: 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. claimed his procedure ...

参考文章(92)
Julien Langou, Laura Grigori, James Demmel, Mark Frederick Hoemmen, Communication-avoiding parallel and sequential QR factorizations ,(2008)
W. E. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem Quarterly of Applied Mathematics. ,vol. 9, pp. 17- 29 ,(1951) , 10.1090/QAM/42792
James W Longley, Modified gram-schmidt process vs. classical gram-schmidt Communications in Statistics - Simulation and Computation. ,vol. 10, pp. 517- 527 ,(1981) , 10.1080/03610918108812227
Ricardo D. Fierro, Per Christian Hansen, Peter Søren Kirk Hansen, UTV Tools: Matlab Templates for Rank-Revealing UTV Decompositions Numerical Algorithms. ,vol. 20, pp. 165- 194 ,(1999) , 10.1023/A:1019112103049
Herman H. Goldstine, A History of Numerical Analysis from the 16th through the 19th Century Sources in the History of Mathematics and Physical Sciences. ,vol. 2, ,(1977) , 10.1007/978-1-4684-9472-3
Gudula Rünger, Michael Schwind, Comparison of Different Parallel Modified Gram-Schmidt Algorithms Euro-Par 2005 Parallel Processing. pp. 826- 836 ,(2005) , 10.1007/11549468_90
Ricardo D. Fierro, Per Christian Hansen, Low-rank revealing UTV decompositions Numerical Algorithms. ,vol. 15, pp. 37- 55 ,(1997) , 10.1023/A:1019254318361