Affiliation:
1. University of California, Berkeley
2. Lawrence Berkeley National Laboratory
Abstract
We present the algorithm, error bounds, and numerical results for extra-precise iterative refinement applied to overdetermined linear least squares (LLS) problems. We apply our linear system refinement algorithm to Björck’s augmented linear system formulation of an LLS problem. Our algorithm reduces the forward normwise and componentwise errors to
O
(
ε
w
), where
ε
w
is the working precision, unless the system is too ill conditioned. In contrast to linear systems, we provide two separate error bounds for the solution
x
and the residual
r
. The refinement algorithm requires only limited use of extra precision and adds only
O
(
mn
) work to the
O
(
mn
2
) cost of QR factorization for problems of size
m
-by-
n
. The extra precision calculation is facilitated by the new extended-precision BLAS standard in a portable way, and the refinement algorithm will be included in a future release of LAPACK and can be extended to the other types of least squares problems.
Funder
Division of Computer and Network Systems
Division of Computing and Communication Foundations
U.S. Department of Energy
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献