Backward error bounds for constrained least squares problems

BIT Numerical Mathematics

Volumn 39, Issue 2, 1999, Pages 210-227

  Cox, Anthony J ^a   Higham, Nicholas J ^b  

^a AIRBUS DEFENCE AND SPACE   (Germany)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Backward error; Backward stability; Elimination method; Equality constrained least squares problem; Least squares minimization over a sphere; Method of weighting; Null space method

Indexed keywords

EID: 0000149962     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022385611904     Document Type: Article

References (30)

1. E. Anderson, Z. Bai, C. H. Bischof, J. W. Demmel, J. J. Dongarra, J. J. Du Croz, A. Greenbaum, S. J. Hammarling, A. McKenney, S. Ostrouchov, and D. C. Sorensen, LAPACK Users' Guide, Release 2.0, 2nd ed., Society for Industrial and Applied Mathematics, Philadelphia, PA, 1995.
2. J. L. Barlow, Error analysis and implementation aspects of deferred correction for equality constrained least squares problems, SIAM J. Numer. Anal., 25:6 (1988), pp. 1340-1358.
3. Å. Björck, Numerical Methods for Least Squares Problems, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1996.
4. Å. Björck and G. H. Golub, Iterative refinement of linear least squares solutions by Householder transformation, BIT, 7 (1967), pp. 322-337.
5. A. J. Cox, Stability of Algorithms for Solving Weighted and Constrained Least Squares Problems, PhD thesis, University of Manchester, Manchester, England, Oct. 1997.
6. A. J. Cox and N. J. Higham, Accuracy and stability of the null space method for solving the equality constrained least squares problem, BIT 39:1 (1999), pp. 34-50.
7. A. J. Cox and N. J. Higham, Row-wise backward stable elimination methods for the equality constrained least squares problem, Numerical Analysis Report No. 319, Manchester Centre for Computational Mathematics, Manchester, England, Mar. 1998. To appear in SIAM J. Matrix Anal. Appl.
8. J. W. Demmel, M. Gu, S. Eisenstat, I. Slapničar, K. Veselić, and Z. Drmač, Computing the singular value decomposition with high relative accuracy, Technical Report CS-97-348, Department of Computer Science, University of Tennessee, Knoxville, TN, Feb. 1997. LAPACK Working Note 119. Revised August 1998.
9. W. Gander, Least squares with a quadratic constraint, Numer. Math., 36 (1981), pp. 291-307.
10. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
11. M. Gu, Backward perturbation bounds for linear least squares problems, SIAM J. Matrix Anal. Appl., 20:2 (1998), pp. 363-372.
12. D. J. Higham and N. J. Higham, Backward error and condition of structured linear systems, SIAM J. Matrix Anal. Appl., 13:1 (1992), pp. 162-175.
13. D. J. Higham and N. J. Higham, Structured backward error and condition of generalized eigenvalue problems, SIAM J. Matrix Anal. Appl., 20:2 (1998), pp. 493-512.
14. N. J. Higham, The Test Matrix Toolbox for MATLAB (version 3.0), Numerical Analysis Report No. 276, Manchester Centre for Computational Mathematics, Manchester, England, Sept. 1995.
15. N. J. Higham, Accuracy and Stability of Numerical Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1996.
16. N. J. Higham, Testing linear algebra software, in Quality of Numerical Software: Assessment and Enhancement, R. F. Boisvert, ed., Chapman & Hall, London, 1997, pp. 109-122.
17. N. J. Higham, QR factorization with complete pivoting and accurate computation of the SVD, Numerical Analysis Report No. 324, Manchester Centre for Computational Mathematics, Manchester, England, Sept. 1998. Submitted to Linear Algebra and Appl.
18. R. Karlson and B. Waldén, Estimation of optimal backward perturbation bounds for the linear least squares problem, BIT, 37:4 (1997), pp. 862-869.
19. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1995. Revised republication of work first published in 1974 by Prentice-Hall.
20. J. J. More and D. C. Sorensen, Computing a trust region step, SIAM J. Sci. Stat. Comput., 4:3 (1983), pp. 553-572.
21. W. Oettli and W. Prager, Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides, Numer. Math., 6 (1964), pp. 405-409.
22. J. L. Rigal and J. Gaches, On the compatibility of a given solution with the data of a linear system, J. Assoc. Comput. Mach., 14:3 (1967), pp. 543-548.
23. G. W. Stewart, On the weighting method for least squares problems with linear equality constraints, BIT, 37:4 (1997), pp. 961-967.
24. J. Sun, A note on backward perturbations for the Hermitian eigenvalue problem, BIT, 35 (1995), pp. 385-393.
25. J. Sun, Optimal backward perturbation bounds for the linear least-squares problem with multiple right-hand sides, IMA J. Numer. Anal., 16:1 (1996), pp. 1-11.
26. J. Sun and Z. Sun, Optimal backward perturbation bounds for underdetermined systems, SIAM J. Matrix Anal. Appl., 18:2 (1997), pp. 393-402.
27. V. J. Torczon, Multi-Directional Search: A Direct Search Algorithm for Parallel Machines, PhD thesis, Rice University, Houston, TX, May 1989.
28. V. J. Torczon, On the convergence of the multidirectional search algorithm, SIAM J. Optimization, 1:1 (1991), pp. 123-145.
29. C. F. Van Loan, On the method of weighting for equality-constrained least-squares problems, SIAM J. Numer. Anal., 22:5 (1985), pp. 851-864.
30. B. Waldén, R. Karlson, and J. Sun, Optimal backward perturbation bounds for the linear least squares problem, Numer. Linear Algebra Appl., 2:3 (1995), pp. 271-286.