2006.141: Solving the indefinite least squares problem by hyperbolic QR factorization
2006.141: Adam Bojanczyk, Nicholas J Higham and Harikrishna Patel (2003) Solving the indefinite least squares problem by hyperbolic QR factorization. SIAM Journal On Matrix Analysis And Applications, 24 (4). pp. 914-931. ISSN 1095-7162
Full text available as:
 | PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 187 Kb |
DOI: 10.1137/S0895479802401497
Abstract
The indefinite least squares (ILS) problem involves minimizing a certain type of indefinite quadratic form. We develop perturbation theory for the problem and identify a condition number. We describe and analyze a method for solving the ILS problem based on hyperbolic QR factorization. This method has a lower operation count than one recently proposed by Chandrasekaran, Gu, and Sayed that employs both QR and Cholesky factorizations. We give a rounding error analysis of the new method and use the perturbation theory to show that under a reasonable assumption the method is forward stable. Our analysis is quite general and sheds some light on the stability properties of hyperbolic transformations. In our numerical experiments the new method is just as accurate as the method of Chandrasekaran, Gu, and Sayed.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | indefinite least squares problem, downdating, hyperbolic rotation, hyperbolic QR factorization, rounding error analysis, forward stability, perturbation theory, condition number |
| Subjects: | MSC 2000 > 15 Linear and multilinear algebra; matrix theory MSC 2000 > 65 Numerical analysis |
| MIMS number: | 2006.141 |
| Deposited By: | Miss Louise Stait |
| Deposited On: | 27 June 2006 |
Download Statistics: last 4 weeks
Repository Staff Only: edit this item