Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization

Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization
复制标题

DOI：
10.1137/s0895479802401497
复制
发表时间：
2002-04
期刊：
SIAM J. Matrix Anal. Appl.
影响因子：
--
通讯作者：
A. Bojanczyk;N. Higham;Harikrishna Patel
A. Bojanczyk;N. Higham;Harikrishna Patel
中科院分区：
其他
文献类型：
--
作者：
A. Bojanczyk;N. Higham;Harikrishna Patel

文献摘要

被引文献

相似文献

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.