Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
From MaRDI portal
Publication:5296012
DOI10.1137/050629148zbMath1157.65355OpenAlexW2012841869MaRDI QIDQ5296012
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
Toeplitz matrixdisplacement structurefast algorithmpseudoinversenumerical experimentationoverdetermined linear systemsCauchy matrixleast-squares solutionaugmented matrixgeneralized Schur algorithm
Related Items (11)
The structured distance to normality of Toeplitz matrices with application to preconditioning ⋮ A fast solver for linear systems with displacement structure ⋮ Orthogonal Cauchy-like matrices ⋮ Randomized preprocessing versus pivoting ⋮ Transformations of matrix structures work again ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices ⋮ How Bad Are Vandermonde Matrices? ⋮ Error estimates for large-scale ill-posed problems ⋮ tpls ⋮ Structures preserved by generalized inversion and Schur complementation
This page was built for publication: Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems