Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
 
research article

A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem

Chandrasekaran, S.
•
Gu, M.
•
Sayed, Ali H.  
1998
SIAM Journal on Matrix Analysis and Applications

We develop an algorithm for the solution of indefinite least-squares problems. Such problems arise in robust estimation, filtering, and control, and numerically stable solutions have been lacking. The algorithm developed herein involves the QR factorization of the coefficient matrix and is provably numerically stable

  • Details
  • Metrics
Type
research article
DOI
10.1137/S0895479896302229
Author(s)
Chandrasekaran, S.
Gu, M.
Sayed, Ali H.  
Date Issued

1998

Publisher

Society for Industrial and Applied Mathematics

Published in
SIAM Journal on Matrix Analysis and Applications
Volume

20

Issue

2

Start page

354

End page

362

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
ASL  
Available on Infoscience
December 22, 2017
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/143539
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés