Fast inversion algorithms for diagonal plus semiseparable matrices
From MaRDI portal
stabilitycomplexityshooting methodstructured matrixdiagonal plus semiseparable matricesmatrix inversion algorithms
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Linear boundary value problems for ordinary differential equations (34B05) Numerical solution of boundary value problems involving ordinary differential equations (65L10)
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 852523 (Why is no real title available?)
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
- Linear complexity algorithms for semiseparable matrices
- Time varying linear systems with boundary conditions and integral operators. I: The transfer operator and its properties
Cited in
(21)- Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
- Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Linear complexity inversion algorithms for a class of structured matrices
- Structured eigenvalue problems for rational Gauss quadrature
- Fast O(n) complexity algorithms for diagonal innovation matrices
- \(O(n)\) algorithms for banded plus semiseparable matrices
- A look-ahead block Schur algorithm for diagonal plus semiseparable matrices
- scientific article; zbMATH DE number 6178058 (Why is no real title available?)
- On some classes of structured matrices with algebraic trigonometric eigenvalues
- A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
- Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
- On a new class of structured matrices
- Representation of quasiseparable matrices using excluded sums and equivalent charges
- Generalized Rybicki Press algorithm.
- Linear complexity algorithm for semiseparable matrices
- Fast inversion algorithms for a class of structured operator matrices.
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
This page was built for publication: Fast inversion algorithms for diagonal plus semiseparable matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378031)