Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
From MaRDI portal
Publication:679264
DOI10.1016/S0898-1221(97)00008-4zbMATH Open0870.65020MaRDI QIDQ679264FDOQ679264
Publication date: 2 September 1997
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (24)
- On a new class of structured matrices
- Fast inversion algorithms for a class of structured operator matrices.
- A look-ahead block Schur algorithm for diagonal plus semiseparable matrices
- Structural and computational properties of possibly singular semiseparable matrices
- Fast inversion algorithms for diagonal plus semiseparable matrices
- Linear complexity algorithm for semiseparable matrices
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Reducing the Dynamical Degradation by Bi-Coupling Digital Chaotic Maps
- Title not available (Why is that?)
- Reducing the dynamical degradation of digital chaotic maps with time-delay linear feedback and parameter perturbation
- Orthogonal basis functions in discrete least-squares rational approximation.
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- Generalized Rybicki Press algorithm
- 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
- Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
- Data-sparse approximation on the computation of a weakly singular Fredholm equation: a stellar radiative transfer application
- A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
- Minimal quasi-separable realizations for the inverse of a quasi-separable operator
- Linear complexity inversion algorithms for a class of structured matrices
- Transformations to rank structures by unitary similarity
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)