A superfast method for solving Toeplitz linear least squares problems.
DOI10.1016/S0024-3795(02)00495-0zbMATH Open1044.65033MaRDI QIDQ1874682FDOQ1874682
Authors: Marc van Barel, G. Heinig, Peter Kravanja 
Publication date: 25 May 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
numerical examplesdiscrete Fourier transformleast squares problemToeplitz matricesblock circulant matricessuperfast algorithmdivide and conquer strategytangential interpolation problemVandermonde block systemvector polynomial interpolation
Cites Work
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Numerical experience with a superfast real Toeplitz solver
- A new algorithm for solving Toeplitz systems of equations
- A stabilized superfast solver for nonsymmetric Toeplitz systems
- New Fast Algorithms for Structured Linear Least Squares Problems
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Title not available (Why is that?)
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- The prolate matrix
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- Linear algebra, rational approximation and orthogonal polynomials
- Fast Parallel Algorithms for QR and Triangular Factorization
- Title not available (Why is that?)
- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- High performance algorithms for Toeplitz and block Toeplitz matrices
- A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
- Downdating of Szegö polynomials and data-fitting applications
- QR factorization of Toeplitz matrices
- Fast Toeplitz orthogonalization
- A fast Hankel solver based on an inversion formula for Loewner matrices
- A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
- Hybrid algorithm for fast Toeplitz orthogonalization
- Fast Toeplitz Orthogonalization Using Inner Products
- Solving Toeplitz systems after extension and transformation
Cited In (15)
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- Title not available (Why is that?)
- Superlinear PCG methods for symmetric Toeplitz systems
- The fast Slepian transform
- A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems
- 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
- A unified least squares approach to identify and to reduce continuous asymptotically stable systems
- A least squares approach to reduce stable discrete linear systems preserving their stability.
- Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems
- A fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
