Abstract
Every invertible matrix \(A\in \mathbb {R}^{n\times n}\) can be uniquely factored as A=QR, where Q is an orthogonal matrix and R is upper triangular with positive diagonal entries. This is called the QR factorization of A, and in numerical linear algebra, different ways for computing it are studied. From the QR factorization one obtains the solution of the system Ax=b by y=Q T b and x=R −1 y, where the latter is easily computed by back substitution.
The Householder QR factorization method is an algorithm for computing the QR-decomposition of a given matrix. It is one of the main engines in numerical linear algebra. The following result states a backward analysis for this algorithm.
Theorem 1.1 Let \(A\in \mathbb {R}^{n\times n}\) be invertible and \(b\in \mathbb {R}^{n}\). If the system Ax=b is solved using the Householder QR factorization method, then the computed solution \(\tilde{x}\) satisfies
where \(\tilde{A}\) and \(\tilde{b}\) satisfy the relative error bounds
where \(\gamma_{cn}:=\frac{cn\epsilon _{\mathsf {mach}}}{1- cn\epsilon _{\mathsf {mach}}}\) with a small constant c. □
This yields \(\|\tilde{A} - A \| \le n^{3/2} \gamma_{cn}\, \| A\|\) when the Frobenius norm is replaced by the spectral norm. It follows from this backward stability result that the relative error for the computed solution \(\tilde{x}\) satisfies
and the loss of precision is bounded by
Here cond(A,b) is the normwise condition number for linear equation solving,
where RelError(A) is defined with respect to the spectral norm and RelError(b) with respect to the Euclidean norm. Inequality (*) calls for a deeper understanding of what cond(A,b) is than the equality above. The pursuit of this understanding is the goal of this chapter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
A.M. Turing. Rounding-off errors in matrix processes. Quarterly Journal of Mechanics and Applied Mathematics, 1:287–308, 1948.
J. von Neumann and H.H. Goldstine. Numerical inverting matrices of high order. Bulletin of the American Mathematical Society, 53:1021–1099, 1947.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bürgisser, P., Cucker, F. (2013). Normwise Condition of Linear Equation Solving. In: Condition. Grundlehren der mathematischen Wissenschaften, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38896-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-38896-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38895-8
Online ISBN: 978-3-642-38896-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)