A Superfast Algorithm for Toeplitz Systems of Linear Equations
From MaRDI portal
Publication:3537447
DOI10.1137/040617200zbMath1221.65084OpenAlexW2105591391WikidataQ56138882 ScholiaQ56138882MaRDI QIDQ3537447
No author found.
Publication date: 6 November 2008
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4c3f4d83439b5220977f782bb8356834f3f14214
Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)
Related Items (26)
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ Every matrix is a product of Toeplitz matrices ⋮ Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh ⋮ An efficient, memory-saving approach for the Loewner framework ⋮ An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem ⋮ A stable parallel algorithm for block tridiagonal Toeplitz-block-Toeplitz linear systems ⋮ A fast solver for linear systems with displacement structure ⋮ Some predictor-corrector-type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory ⋮ A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices ⋮ Singular matrices whose Moore-Penrose inverse is tridiagonal ⋮ Randomized preprocessing versus pivoting ⋮ A novel and accurate finite difference method for the fractional Laplacian and the fractional Poisson problem ⋮ Fast structured LU factorization for nonsymmetric matrices ⋮ Transformations of matrix structures work again ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ Fast Solution Methods for Convex Quadratic Optimization of Fractional Differential Equations ⋮ On \(k\)-circulant matrices involving the Pell-Lucas (and the modified Pell) numbers ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Direct Inversion of the Three-Dimensional Pseudo-polar Fourier Transform ⋮ 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 ⋮ A Low-Rank Technique for Computing the Quasi-Stationary Distribution of Subcritical Galton--Watson Processes ⋮ How Bad Are Vandermonde Matrices? ⋮ A stable matrix version of the fast multipole method: stabilization strategies and examples ⋮ High-performance processing of covariance matrices using GPU computations ⋮ Fast approximate computations with Cauchy matrices and polynomials
Uses Software
This page was built for publication: A Superfast Algorithm for Toeplitz Systems of Linear Equations