Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems

DOI10.1137/050629148zbMATH Open1157.65355OpenAlexW2012841869MaRDI QIDQ5296012FDOQ5296012

Authors: G. Rodriguez 

Publication date: 31 July 2007

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

Full work available at URL: https://doi.org/10.1137/050629148

Recommendations

• A superfast method for solving Toeplitz linear least squares problems.
• scientific article; zbMATH DE number 2151323
• A Superfast Algorithm for Toeplitz Systems of Linear Equations
• Schur-Type Methods for Solving Least Squares Problems with Toeplitz Structure
• New Fast Algorithms for Structured Linear Least Squares Problems

zbMATH Keywords

fast algorithmToeplitz matrixCauchy matrixpseudoinversenumerical experimentationleast-squares solutionoverdetermined linear systemsdisplacement structureaugmented matrixgeneralized Schur algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cited In (24)

• Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
• A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
• How bad are Vandermonde matrices?
• Title not available (Why is that?)
• Schur-Type Methods for Solving Least Squares Problems with Toeplitz Structure
• Fast robust regression algorithms for problems with Toeplitz structure
• Orthogonal Cauchy-like matrices
• Fast Least-Squares Padé approximation of problems with normal operators and meromorphic structure
• Title not available (Why is that?)
• Solving Toeplitz least squares problems by means of Newton's iteration
• Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
• Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems
• A superfast method for solving Toeplitz linear least squares problems.
• Transformations of matrix structures work again
• A fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms
• tpls
• A fast solver for linear systems with displacement structure
• Structures preserved by generalized inversion and Schur complementation
• Randomized preprocessing of homogeneous linear systems of equations
• Fast least squares approximation using tensor products of functions and linear forms
• Title not available (Why is that?)
• Error estimates for large-scale ill-posed problems
• Randomized preprocessing versus pivoting
• The structured distance to normality of Toeplitz matrices with application to preconditioning.

This page was built for publication: Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems

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