New Fast Algorithms for Structured Linear Least Squares Problems

DOI10.1137/S089547989529646XzbMath0948.65039MaRDI QIDQ4243503

Ming Gu

Publication date: 18 May 1999

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

zbMATH Keywords

algorithmstabilitycomparison of methodserror analysisToeplitz matrixcomputational efficiencylinear least squares problemiterative refinement

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

A superfast method for solving Toeplitz linear least squares problems. ⋮ Simple backward error bounds for linear least-squares problems ⋮ A least squares approach to reduce stable discrete linear systems preserving their stability. ⋮ A unified least squares approach to identify and to reduce continuous asymptotically stable systems

Uses Software

• LAPACK
• mctoolbox

This page was built for publication: New Fast Algorithms for Structured Linear Least Squares Problems