BIT Numerical Mathematics

, Volume 43, Issue 3, pp 505–517

The Equality Constrained Indefinite Least Squares Problem: Theory and Algorithms

Authors

  • Adam Bojanczyk
    • School of Electrical and Computer EngineeringCornell University
  • Nicholas J. Higham
    • School of Electrical and Computer EngineeringCornell University
  • Harikrishna Patel
    • School of Electrical and Computer EngineeringCornell University
Article

DOI: 10.1023/B:BITN.0000007020.58972.07

Cite this article as:
Bojanczyk, A., Higham, N. & Patel, H. BIT Numerical Mathematics (2003) 43: 505. doi:10.1023/B:BITN.0000007020.58972.07

Abstract

We present theory and algorithms for the equality constrained indefinite least squares problem, which requires minimization of an indefinite quadratic form subject to a linear equality constraint. A generalized hyperbolic QR factorization is introduced and used in the derivation of perturbation bounds and to construct a numerical method. An alternative method is obtained by employing a generalized QR factorization in combination with a Cholesky factorization. Rounding error analysis is given to show that both methods have satisfactory numerical stability properties and numerical experiments are given for illustration. This work builds on recent work on the unconstrained indefinite least squares problem by Chandrasekaran, Gu, and Sayed and by the present authors.

equality constrained indefinite least squares problemJ-orthogonal matrixhyperbolic rotationhyperbolic QR factorizationgeneralized hyperbolic QR factorizationrounding error analysisforward stabilityperturbation theoryCholesky factorization

Copyright information

© Kluwer Academic Publishers 2003