%0 Journal Article
%J SIAM Journal on Matrix Analysis and Applications
%D 2005
%T Error Analysis of the Quasi-Gramâ€“Schmidt Algorithm
%A Stewart, G.W.
%K Gramâ€“Schmidt algorithm
%K orthogonalization
%K QR factorization
%K rounding-error analysis
%K sparse matrix
%X Let the $n\,{\times}\,p$ $(n\geq p)$ matrix $X$ have the QR factorization $X = QR$, where $R$ is an upper triangular matrix of order $p$ and $Q$ is orthonormal. This widely used decomposition has the drawback that $Q$ is not generally sparse even when $X$ is. One cure is to discard $Q$, retaining only $X$ and $R$. Products like $a = Q\trp y = R\itp X\trp y$ can then be formed by computing $b = X\trp y$ and solving the system $R\trp a = b$. This approach can be used to modify the Gram--Schmidt algorithm for computing $Q$ and $R$ to compute $R$ without forming $Q$ or altering $X$. Unfortunately, this quasi-Gram--Schmidt algorithm can produce inaccurate results. In this paper it is shown that with reorthogonalization the inaccuracies are bounded under certain natural conditions.
%B SIAM Journal on Matrix Analysis and Applications
%V 27
%P 493 - 506
%8 2005///
%G eng
%U http://link.aip.org/link/?SML/27/493/1
%N 2
%R 10.1137/040607794