Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
From MaRDI portal
Publication:679264
DOI10.1016/S0898-1221(97)00008-4zbMath0870.65020MaRDI QIDQ679264
Yu.S.Eidel'man, Israel Gohberg
Publication date: 2 September 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Related Items
Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal, Minimal quasi-separable realizations for the inverse of a quasi-separable operator, A modification of the Dewilde-van der Veen method for inversion of finite structured matrices, Reducing the Dynamical Degradation by Bi-Coupling Digital Chaotic Maps, Fast inversion algorithms for diagonal plus semiseparable matrices, Linear complexity algorithm for semiseparable matrices, A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band 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, Data-sparse approximation on the computation of a weakly singular Fredholm equation: a stellar radiative transfer application, Generalized Rybicki Press algorithm, Unnamed Item, Transformations to rank structures by unitary similarity, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration, A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices, On a new class of structured matrices, Linear complexity inversion algorithms for a class of structured matrices, A look-ahead block Schur algorithm for diagonal plus semiseparable matrices
Cites Work
