Pages that link to "Item:Q815265"

The following pages link to A fast algorithm for the inversion of general Toeplitz matrices (Q815265):

Displaying 33 items.

• The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations (Q316678) (← links)
• FaIMS: a fast algorithm for the inverse medium problem with multiple frequencies and multiple sources for the scalar Helmholtz equation (Q441933) (← links)
• A new algorithm for solving nearly penta-diagonal Toeplitz linear systems (Q453854) (← links)
• Transformations of matrix structures work again (Q471925) (← links)
• A randomized algorithm for the decomposition of matrices (Q617703) (← links)
• Structured eigenvalue condition numbers for parameterized quasiseparable matrices (Q728451) (← links)
• Randomized interpolative decomposition of separated representations (Q728743) (← links)
• A fast randomized algorithm for the approximation of matrices (Q952399) (← links)
• A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks (Q972758) (← links)
• A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions (Q980255) (← links)
• Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates (Q1684462) (← links)
• Efficient solution of block Toeplitz systems with multiple right-hand sides arising from a periodic boundary element formulation (Q2040841) (← links)
• A stable matrix version of the fast multipole method: stabilization strategies and examples (Q2055513) (← links)
• The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations (Q2282367) (← links)
• Iterative methods to solve the generalized coupled Sylvester-conjugate matrix equations for obtaining the centrally symmetric (centrally antisymmetric) matrix solutions (Q2336498) (← links)
• Efficient algorithms for CUR and interpolative matrix decompositions (Q2363512) (← links)
• Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix (Q2397290) (← links)
• The fast Slepian transform (Q2415405) (← links)
• On the stability of unevenly spaced samples for interpolation and quadrature (Q2697551) (← links)
• Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions (Q2805015) (← links)
• How Bad Are Vandermonde Matrices? (Q2813332) (← links)
• Some predictor-corrector-type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory (Q2948084) (← links)
• Randomized Local Model Order Reduction (Q3174769) (← links)
• The iterative algorithm for solving a class of generalized coupled Sylvester-transpose equations over centrosymmetric or anti-centrosymmetric matrix (Q5031717) (← links)
• SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices (Q5038407) (← links)
• Analytical Low-Rank Compression via Proxy Point Selection (Q5146610) (← links)
• Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597) (← links)
• A Petrov--Galerkin Spectral Method of Linear Complexity for Fractional Multiterm ODEs on the Half Line (Q5268984) (← links)
• Fast approximate computations with Cauchy matrices and polynomials (Q5270834) (← links)
• Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions (Q5740197) (← links)
• Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
• A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
• Estimates of the size of the domain of the implicit function theorem: a mapping degree-based approach (Q6188533) (← links)