A fast algorithm for the inversion of general Toeplitz matrices
From MaRDI portal
The authors describe a fast algorithm for the construction of a data-sparse inverse of a general Toeplitz matrix. The algorithm is based on the fact that the representation of the Toeplitz matrix in Fourier space has off-diagonal blocks that can be approximated by low-rank matrices. Numerical experiments, showing the good behaviour of the algorithm are also presented.
Recommendations
Cites work
- A fast and stable solver for recursively semi-separable systems of linear equations
- A fast direct solver for boundary integral equations in two dimensions
- A stabilized superfast solver for nonsymmetric Toeplitz systems
- A Superfast Toeplitz Solver with Improved Numerical Stability
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Classical foundations of algorithms for solving positive definite Toeplitz equations
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast Algorithms for Structured Matrices: Theory and Applications
- Fast Fourier transforms for nonequispaced data. II
- scientific article; zbMATH DE number 1955860 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- On a property of Cauchy-like matrices
- On the Compression of Low Rank Matrices
- Superfast algorithms for Cauchy-like matrix computations and extensions
- Toeplitz Matrix Inversion: The Algorithm of W. F. Trench
Cited in
(72)- Fast matrix factorizations via discrete transmission lines
- Fast inversion algorithms of Toeplitz-plus-Hankel matrices
- Stabilizing Trench's algorithm to invert symmetric Toeplitz matrices
- Fast computation of the principal singular vectors of Toeplitz matrices arising in exponential data modelling
- Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates
- An algorithm for the inversion of a discrete convolution by the partitioning method
- A new algorithm for 5-band Toeplitz matrix inversion with application to GCV smoothing spline computation
- Efficient solution of block Toeplitz systems with multiple right-hand sides arising from a periodic boundary element formulation
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations
- Iterative methods to solve the generalized coupled Sylvester-conjugate matrix equations for obtaining the centrally symmetric (centrally antisymmetric) matrix solutions
- Efficient algorithms for CUR and interpolative matrix decompositions
- Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix
- The fast Slepian transform
- On the stability of unevenly spaced samples for interpolation and quadrature
- Stability of Toeplitz matrix inversion formulas
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- How bad are Vandermonde matrices?
- A fast algorithm for inversion of real lower triangular Toeplitz matrices
- Some predictor-corrector-type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory.
- Acceleration of the Inversion of Triangular Toeplitz Matrices and Polynomial Division
- The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations
- Randomized local model order reduction
- scientific article; zbMATH DE number 5127891 (Why is no real title available?)
- A new fast algorithm for products of Toeplitz matrices
- Efficient inversion of Toeplitz-block Toeplitz matrix
- scientific article; zbMATH DE number 4043146 (Why is no real title available?)
- scientific article; zbMATH DE number 4109940 (Why is no real title available?)
- scientific article; zbMATH DE number 1292985 (Why is no real title available?)
- Modified SMS method for computing outer inverses of Toeplitz matrices
- Fast cosine transform of Toeplitz matrices, algorithm and applications
- scientific article; zbMATH DE number 741189 (Why is no real title available?)
- FaIMS: a fast algorithm for the inverse medium problem with multiple frequencies and multiple sources for the scalar Helmholtz equation
- A new algorithm for solving nearly penta-diagonal Toeplitz linear systems
- scientific article; zbMATH DE number 954675 (Why is no real title available?)
- Transformations of matrix structures work again
- scientific article; zbMATH DE number 782073 (Why is no real title available?)
- scientific article; zbMATH DE number 839263 (Why is no real title available?)
- Scaling Bini's algorithm for fast inversion of triangular Toeplitz matrices
- scientific article; zbMATH DE number 6178058 (Why is no real title available?)
- scientific article; zbMATH DE number 7336006 (Why is no real title available?)
- The iterative algorithm for solving a class of generalized coupled Sylvester-transpose equations over centrosymmetric or anti-centrosymmetric matrix
- Fast algorithms for multiplication of Foeplitz matrix and vector from interesting inverse
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Analytical low-rank compression via proxy point selection
- Inversion of Toeplitz Matrices which are not Strongly Non-singular
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- A Petrov-Galerkin spectral method of linear complexity for fractional multiterm ODEs on the half line
- Fast approximate computations with Cauchy matrices and polynomials
- Superfast inversion of two-level Toeplitz matrices using Newton iteration and tensor-displacement structure
- scientific article; zbMATH DE number 5060289 (Why is no real title available?)
- Generalized Rybicki Press algorithm.
- Low-rank approximation of a matrix: novel insights, new progress, and extensions
- Randomized numerical linear algebra: Foundations and algorithms
- Fast inversion of triangular Toeplitz matrices
- Fast inversion of triangular Toeplitz matrices
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- A randomized algorithm for the decomposition of matrices
- Estimates of the size of the domain of the implicit function theorem: a mapping degree-based approach
- A low-complexity algorithm to digitally uncouple the mutual coupling effect in antenna arrays via symmetric Toeplitz matrices
- Inversion and spectral analysis of matrices arising in the analysis of Markov processes
- Compression properties for large Toeplitz-like matrices
- Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semiseparable least squares
- Padé-based nonlinear approximation of bivariate non-smooth functions
- Fast machine-precision spectral likelihoods for stationary time series
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
- Randomized interpolative decomposition of separated representations
- Tensor product factorization-based numerical algorithms for the inverses of generalized banded Toeplitz matrices
- A fast randomized algorithm for the approximation of matrices
- The inversion of Gabor-type matrices
- A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
This page was built for publication: A fast algorithm for the inversion of general Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815265)
