Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices

DOI10.1016/S0898-1221(97)00008-4MaRDI QIDQ679264zbMATH OpenFDO

Authors Y. Eidelman, I. Gohberg

Publication date 2 September 1997

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(97)00008-4

zbMATH Keywords

inversion formulaslinear complexity algorithmsemiseparable matrices

Mathematics Subject Classification ID

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

Review text

Sums of diagonal and semiseparable matrices belong to the class of structured matrices which arises in numerical applications. Fast \(O(N)\) algorithms for their inversion were developed earlier under additional restrictions which were a source of instability. For semiseparable matrices of order one these restrictions are eliminated.

Recommendations

• Fast inversion algorithms for diagonal plus semiseparable matrices
• Fast inversion algorithms for a class of structured operator matrices.
• Linear complexity inversion algorithms for a class of structured matrices
• On a new class of structured matrices

Cites work

• 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

(24)

• New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
• On a new class of structured matrices
• Linear complexity inversion algorithms for a class of structured matrices
• A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
• Fast inversion algorithms for diagonal plus semiseparable matrices
• Linear complexity algorithm for semiseparable matrices
• Fast inversion algorithms for a class of structured operator matrices.
• Orthogonal basis functions in discrete least-squares rational approximation.
• Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• A look-ahead block Schur algorithm for diagonal plus semiseparable matrices
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Minimal quasi-separable realizations for the inverse of a quasi-separable operator
• A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• Fast inversion algorithms for a class of block structured matrices
• Reducing the Dynamical Degradation by Bi-Coupling Digital Chaotic Maps
• scientific article; zbMATH DE number 2098303 (Why is no real title available?)
• Data-sparse approximation on the computation of a weakly singular Fredholm equation: a stellar radiative transfer application
• Transformations to rank structures by unitary similarity
• Generalized Rybicki Press algorithm.
• Structural and computational properties of possibly singular semiseparable matrices
• Reducing the dynamical degradation of digital chaotic maps with time-delay linear feedback and parameter perturbation
• Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal

This page was built for publication: Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679264)