Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form

DOI10.1023/A:1021973919347zbMath0984.65041OpenAlexW266430444MaRDI QIDQ5937104

Shivkumar Chandrasekaran, Sabine Van Huffel, Nicola Mastronardi

Publication date: 14 May 2002

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021973919347

zbMATH Keywords

fast algorithmsreductiondiagonal plus semi-separable matricesstable algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Canonical forms, reductions, classification (15A21)

Related Items (9)

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 Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices ⋮ A unification of unitary similarity transforms to compressed representations ⋮ AQZ-method based on semiseparable matrices ⋮ Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations ⋮ The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order ⋮ Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices ⋮ An efficient method for computing the inverse of arrowhead matrices

This page was built for publication: Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form