An Efficient Approach to the Linear Least Squares Problem

DOI10.1137/S0895479801386596zbMATH Open1080.65030MaRDI QIDQ4651012FDOQ4651012

Authors:

Publication date: 21 February 2005

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 811973
• scientific article; zbMATH DE number 4192954
• scientific article; zbMATH DE number 852525
• scientific article; zbMATH DE number 800208
• Efficient Solution Of The Rank-Deficient Linear Least Squares Problem

zbMATH Keywords

least squares problemQR decompositionorthogonalizationpseudoinversesnormal pseudosolution

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)

Cited In (13)

• An efficient algorithm for the separable nonlinear least squares problem
• Title not available (Why is that?)
• An efficient LDU algorithm for the minimal least squares solution of linear systems
• A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
• A \(QR\) decomposition for matrix pencils
• Flexible least squares for approximately linear systems
• A low-cost optimization approach for solving minimum norm linear systems and linear least-squares problems
• Title not available (Why is that?)
• Solving the linear least squares problem with very high relative accuracy
• Solution of linear least squares via the ABS algorithm
• A least squares approach for efficient and reliable short-term versus long-term optimization
• An Efficient Algorithm for the Classical Least Squares Approximation
• Title not available (Why is that?)

This page was built for publication: An Efficient Approach to the Linear Least Squares Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651012)