Linear complexity inversion algorithms for a class of structured matrices
DOI10.1007/BF01225526zbMATH Open0949.65021OpenAlexW2056598261MaRDI QIDQ1306290FDOQ1306290
Publication date: 20 December 1999
Published in: Integral Equations and Operator Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01225526
numerical experimentsstructured matricestridiagonal matricesdescriptor linear systemsquasiseparable matricesdiagonal plus semiseparable matriceslinear complexity inversion algorithmmatrices of input output operators
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Theory of matrix inversion and generalized inverses (15A09) Linear systems in control theory (93C05) Input-output approaches in control theory (93D25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Time varying linear systems with boundary conditions and integral operators. I: The transfer operator and its properties
- Linear complexity algorithms for semiseparable matrices
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
- Fast inversion algorithms for diagonal plus semiseparable matrices
- Title not available (Why is that?)
Cited In (20)
- Fast inversion algorithms for a class of structured operator matrices.
- Signal flow graph approach to inversion of \((H,m)\)-quasiseparable-Vandermonde matrices and new filter structures
- Title not available (Why is that?)
- Iterative inversion of structured matrices
- Linear complexity algorithm for semiseparable matrices
- Title not available (Why is that?)
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Fast direct solvers for integral equations in complex three-dimensional domains
- Direct approach to the band completion problem
- Green's matrices
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices
- Computing Inverse ST in Linear Complexity
- A linear symbolic-based approach to matrix inversion
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
- Fast inversion algorithms for a class of block structured matrices
- Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices
- Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices
Recommendations
- Fast inversion algorithms for a class of block structured matrices 👍 👎
- Fast inversion algorithms for a class of structured operator matrices. 👍 👎
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices 👍 👎
- On a new class of structured matrices 👍 👎
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices 👍 👎
This page was built for publication: Linear complexity inversion algorithms for a class of structured matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306290)
