Abstract | ||
---|---|---|
An error analysis result is given for classical Gram–Schmidt factorization of a full rank matrix A into A = QR where Q is left orthogonal (has orthonormal columns) and R is upper triangular. The work presented here shows that the computed R satisfies RT R = AT A + E where E is an appropriately small backward error, but only if the diagonals of R are computed in a manner similar to Cholesky factorization of the normal equations matrix. At the end of the article, implications for classical Gram–Schmidt with reorthogonalization are noted.A similar result is stated in Giraud et al. (Numer Math 101(1):87–100, 2005). However, for that result to hold, the diagonals of R must be computed in the manner recommended in this work. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/s00211-006-0042-1 | Numerische Mathematik |
Keywords | Field | DocType |
cholesky factorization,numerical analysis,satisfiability | Rank (linear algebra),Combinatorics,Gram–Schmidt process,Matrix (mathematics),Orthonormal basis,Factorization,Triangular matrix,Mathematics,Normal matrix,Cholesky decomposition | Journal |
Volume | Issue | ISSN |
105 | 2 | Numerische Mathematik, 105(2):299-313, December 2006 |
Citations | PageRank | References |
5 | 0.61 | 3 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alicja Smoktunowicz | 1 | 18 | 4.24 |
Jesse L. Barlow | 2 | 95 | 13.17 |
Julien Langou | 3 | 1028 | 71.98 |