Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices

DOI10.1023/B:NUMA.0000005402.66868.AFzbMath1053.65025MaRDI QIDQ1418849

Dario Fasino, Luca Gemignani

Publication date: 14 January 2004

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

eigenvalue problemsinverse eigenvalue problemQR factorizationsemiseparable matricesband matricescongruence transformationCauchy matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items (9)

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal ⋮ Computations with quasiseparable polynomials and matrices ⋮ Orthogonal rational functions on the unit circle with prescribed poles not on the unit circle ⋮ A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices ⋮ Neville elimination for rank-structured matrices ⋮ Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations ⋮ On some classes of structured matrices with algebraic trigonometric eigenvalues ⋮ Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices ⋮ A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices

This page was built for publication: Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices