A fast algorithm for the inversion of general Toeplitz matrices

DOI10.1016/j.camwa.2005.03.011zbMath1087.65025OpenAlexW1984265227MaRDI QIDQ815265

Mark Tygert, Per-Gunnar Martinsson, Vladimir Rokhlin

Publication date: 16 February 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.03.011

zbMATH Keywords

numerical experiments Toeplitz matrix fast algorithm direct inversion data-sparse inverse

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

The iterative algorithm for solving a class of generalized coupled Sylvester-transpose equations over centrosymmetric or anti-centrosymmetric matrix, SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, Efficient algorithms for CUR and interpolative matrix decompositions, Randomized numerical linear algebra: Foundations and algorithms, Randomized Local Model Order Reduction, The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations, Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix, The fast Slepian transform, Some predictor-corrector-type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory, Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates, A randomized algorithm for the decomposition of matrices, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Estimates of the size of the domain of the implicit function theorem: a mapping degree-based approach, On the stability of unevenly spaced samples for interpolation and quadrature, 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, Transformations of matrix structures work again, Analytical Low-Rank Compression via Proxy Point Selection, A fast randomized algorithm for the approximation of matrices, Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions, 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, Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views, The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations, Structured eigenvalue condition numbers for parameterized quasiseparable matrices, Randomized interpolative decomposition of separated representations, Efficient solution of block Toeplitz systems with multiple right-hand sides arising from a periodic boundary element formulation, Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions, How Bad Are Vandermonde Matrices?, A stable matrix version of the fast multipole method: stabilization strategies and examples, Iterative methods to solve the generalized coupled Sylvester-conjugate matrix equations for obtaining the centrally symmetric (centrally antisymmetric) matrix solutions, A Petrov--Galerkin Spectral Method of Linear Complexity for Fractional Multiterm ODEs on the Half Line, Fast approximate computations with Cauchy matrices and polynomials

Cites Work