A superfast method for solving Toeplitz linear least squares problems.
From MaRDI portal
Publication:1874682
Recommendations
Cites work
- scientific article; zbMATH DE number 686840 (Why is no real title available?)
- scientific article; zbMATH DE number 778080 (Why is no real title available?)
- A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
- A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
- A fast Hankel solver based on an inversion formula for Loewner matrices
- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- A new algorithm for solving Toeplitz systems of equations
- A stabilized superfast solver for nonsymmetric Toeplitz systems
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Downdating of Szegö polynomials and data-fitting applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast Parallel Algorithms for QR and Triangular Factorization
- Fast Toeplitz Orthogonalization Using Inner Products
- Fast Toeplitz orthogonalization
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Hybrid algorithm for fast Toeplitz orthogonalization
- Linear algebra, rational approximation and orthogonal polynomials
- New Fast Algorithms for Structured Linear Least Squares Problems
- Numerical experience with a superfast real Toeplitz solver
- QR factorization of Toeplitz matrices
- Solving Toeplitz systems after extension and transformation
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Superfast Solution of Real Positive Definite Toeplitz Systems
- The prolate matrix
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
Cited in
(15)- A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems
- A unified least squares approach to identify and to reduce continuous asymptotically stable systems
- scientific article; zbMATH DE number 1617949 (Why is no real title available?)
- A fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms
- scientific article; zbMATH DE number 2151323 (Why is no real title available?)
- Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems
- scientific article; zbMATH DE number 7625175 (Why is no real title available?)
- scientific article; zbMATH DE number 4147401 (Why is no real title available?)
- Schur-Type Methods for Solving Least Squares Problems with Toeplitz Structure
- Superlinear PCG methods for symmetric Toeplitz systems
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- Fast robust regression algorithms for problems with Toeplitz structure
- The fast Slepian transform
- A least squares approach to reduce stable discrete linear systems preserving their stability.
This page was built for publication: A superfast method for solving Toeplitz linear least squares problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874682)
