Fast stable solver for sequentially semi-separable linear systems of equations
From MaRDI portal
Recommendations
- Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
- Fast and stable solution of banded-plus-semiseparable linear systems
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- scientific article; zbMATH DE number 2098303
- Some Fast Algorithms for Sequentially Semiseparable Representations
Cited in
(23)- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- An MSSS-preconditioned matrix equation approach for the time-harmonic elastic wave equation at multiple frequencies
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- The spectral connection matrix for classical orthogonal polynomials of a single parameter
- Minimal quasi-separable realizations for the inverse of a quasi-separable operator
- A preconditioned GMRES for complex dense linear systems from electromagnetic wave scattering problems
- Fast and stable solution of banded-plus-semiseparable linear systems
- scientific article; zbMATH DE number 3919643 (Why is no real title available?)
- Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
- Linear computational complexity robust ILC for lifted systems
- scientific article; zbMATH DE number 2098303 (Why is no real title available?)
- Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- HODLR2D: A New Class of Hierarchical Matrices
- Exact computations with quasiseparable matrices
- Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver
- On the LU factorization of infinite systems of semi-separable equations
- Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semiseparable representations
- Condition numbers for the Moore-Penrose inverse and the least squares problem involving rank-structured matrices
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Quasi-optimal hierarchically semi-separable matrix approximation
- Kernel matrix approximations by sums of exponentials and stability of fast structured transforms
- A fast algorithm for the inversion of general Toeplitz matrices
This page was built for publication: Fast stable solver for sequentially semi-separable linear systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417509)
