Extra-precise iterative refinement for overdetermined least squares problems

ACM Transactions on Mathematical Software

Volumn 35, Issue 4, 2009, Pages

  Demmel, James ^a,c   Hida, Yozo ^a,c   Riedy, E Jason ^a,c   Li, Xiaoye S ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

BLAS; Floating point arithmetic; LAPACK; Linear algebra

Indexed keywords

BLAS; COMPONENT WISE; ERROR BOUNDS; FLOATING-POINT ARITHMETIC; ILL-CONDITIONED; ITERATIVE REFINEMENTS; LAPACK; LEAST SQUARES PROBLEMS; LINEAR LEAST SQUARES; NUMERICAL RESULTS; Q R FACTORIZATIONS; REFINEMENT ALGORITHMS; SYSTEM FORMULATIONS; SYSTEM REFINEMENTS;

ALGEBRA; CURVE FITTING; ELECTRIC APPLIANCES; LEAST SQUARES APPROXIMATIONS; LINEAR SYSTEMS; MANGANESE COMPOUNDS;

ALGORITHMS;

EID: 61349142482     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1462173.1462177     Document Type: Article

References (21)

1. ARIOLI, M., BABOULIN, M., AND GRATTON, S. 2007. A partial condition number for linear least squares problems. SIAM J. Matrix Anal. Appl. 29, 2, 413-433.
2. BAILEY, D. 2009. A Fortran-90 double-double precision library. http://crd.lbl.gov/~dhbailey/mpdist.
3. B JÖRCK, Å. 1967. Iterative refinement of linear least squares solutions I. BIT 7, 257-278.
4. BJÖRCK, Å. 1991. Component-Wise perturbation analysis and error bounds for linear least squares solutions. BIT 31, 238-244.
5. B JÖRCK, Å. 1996. Numerical Methods for Least Squares Problems. SIAM, Philadelphia, PA.
6. BJÖRCK, Å. AND GOLUB, G. 1967. Iterative refinement of linear least squares solution by Householder transformation (Algol programming). BIT 7, 322-337.
7. CUCKER, P., DIAO, H., AND WEI, Y. 2007. On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems. Math. Comput. 76, 258, 947-963.
8. DEMMEL , J., HIDA, Y., KAHAN, W., Li, X., MUKHERJEE, S., AND RIEDY, E. 2006. Error bounds from xtra-precise iterative refinement. ACM Trans. Math. Softw. 32, 2, 325-351.
9. FORSYTHE, G. E. AND MOLER, C. B. 1967. Computer Solution of Linear Algebraic Systems. Prentice-Hall, Englewood Cliffs, NJ.
10. GULLIKSSON, M. 1994. Iterative refinement for constrained and weighted linear least squares. BIT 34, 2, 239-253.
11. HIGHAM, N. J. 1988. FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation. ACM Trans. Math. Softw. 14, 4, 381-396.
12. HIGHAM, N. J. 1996. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, PA.
13. KIELBASINSKI, A. AND SCHWETLICK, H. 1988. Numerische Lineare Algebra: Eine Computerorientierte Einführung. VEB Deutscher, Berlin.
14. LANGOU, J., LANGOU, J., LUSZCZEK, P., KUEZAK, J., BUTTARI, A., AND DONGARRA, J. 2006. Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems). Tech. rep., University of Tennessee, Knoxville, TN. June.
15. LI, X. S., DEMMEL, J. W., BAILEY, D. H., HENRY, G., HIDA, Y, ISKANDAR, J., KAHAN, W., KANG, S. Y., KAPUE, A., MARTIN, M. C., THOMPSON, B. J., TUNG, T., AND YOO, D. J. 2002. Design, implementation and testing of extended and mixed precision BLAS. ACM Trans. Math. Softw. 28, 2, 152-205.
16. OETTLI, W. AND PRAGER, W. 1964. Compatibility of approxmate solution of linear equations with given error bounds for coefficients and right-hand sides. Numer. Math. 6, 405-409.
17. REID, J. 2000. Implicit scaling of linear least squares problems. BIT 40, 1, 146-157.
18. RIGAL, J. AND GACHES, J. 1967. On the compatibility of a given solution with the data of a linear system. J. ACM 14, 3, 543-548.
19. STEWART, G. W. 1977. On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM Rev. 19, 4, 634-662.
20. WALDEN, B., KAŖSON, R., AND J., S. 1995. Optimal backward perturbation bounds for the linear least squares problem. Numer. Lin. Alg. Appl. 2, 3, 271-286.
21. WAMPLER, R. H. 1970. A report on the accuracy of some widely used least squares computer programs (in applications). J. Amer. Statist. Assoc. 65, 330, 549-565.