Linear complexity algorithm for semiseparable matrices

DOI10.1007/BF01320704zbMath0901.65014OpenAlexW2062028527MaRDI QIDQ1378051

Israel Koltracht

Publication date: 26 November 1998

Published in: Integral Equations and Operator Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01320704

zbMATH Keywords

algorithmnumerical examplesinverse matrixsymmetric matricessemiseparable coefficient matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Fast inversion algorithms for a class of structured operator matrices. ⋮ On some classes of structured matrices with algebraic trigonometric eigenvalues ⋮ On the inversion of the Vandermonde matrix ⋮ A QR-method for computing the singular values via semiseparable matrices ⋮ Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations ⋮ Structural and computational properties of possibly singular semiseparable matrices

Cites Work

• Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
• Time varying linear systems with boundary conditions and integral operators. I: The transfer operator and its properties
• Linear complexity algorithms for semiseparable matrices
• Integral equation method for the continuous spectrum radial Schrödinger equation
• Fast inversion algorithms for diagonal plus semiseparable matrices
• On band matrices and their inverses