Abstract
In this paper a method of estimating the optimal backward perturbation bound for the linear least squares problem is presented. In contrast with the optimal bound, which requires a singular value decomposition, this method is better suited for practical use on large problems since it requiresO(mn) operations. The method presented involves the computation of a strict lower bound for the spectral norm and a strict upper bound for the Frobenius norm which gives a gap in which the optimal bounds for the spectral and the Frobenius norm must be. Numerical tests are performed showing that this method produces an efficient estimate of the optimal backward perturbation bound.
Similar content being viewed by others
References
G. H. Golub and C. F. Van Loan,Matrix Computations, 2nd edition, The Johns Hopkins University Press, Baltimore, Maryland, 1989.
N. J. Higham,Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
J.-G. Sun,Optimal backward perturbation bounds for the linear least-squares problem with multiple right-hand sides, IMA J. Numer. Anal., 16 (1996), pp. 1–11.
J.-G. Sun and Zheng Sun,Optimal backward perturbation bounds for underdetermined systems, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 393–402.
B. Waldén, R. Karlson, and J.-G. Sun,Optimal backward perturbation bounds for the linear least squares problem, Numerical Linear Algebra with Application, 2:3 (1995), pp. 271–286.
P. Å. Wedin, Private communications.
Author information
Authors and Affiliations
Additional information
Communicated by Axel Ruhe.
This paper was first presented on the conference “Least Squares Methods: theory, Algorithms and Applications” on the occasion of the 60th birthday of Åke Björck.
Rights and permissions
About this article
Cite this article
Karlson, R., Waldén, B. Estimation of optimal backward perturbation bounds for the linear least squares problem. Bit Numer Math 37, 862–869 (1997). https://doi.org/10.1007/BF02510356
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02510356