The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
From MaRDI portal
Publication:2484401
DOI10.1016/j.laa.2005.02.037zbMath1079.65038OpenAlexW2071077570MaRDI QIDQ2484401
Yu.S.Eidel'man, Israel Gohberg, Vadim Olshevsky
Publication date: 1 August 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.02.037
eigenvalue problemnumerical experimentssemiseparable matricesQR iterationquasi-separable matricesDewilde-van der Veen methodHermitian separable matrices
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)
Related Items
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications, Computations with quasiseparable polynomials and matrices, A fast implicit QR eigenvalue algorithm for companion matrices, On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms, Time and space efficient generators for quasiseparable matrices, A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices, Singular matrices whose Moore-Penrose inverse is tridiagonal, A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices, Representation of quasiseparable matrices using excluded sums and equivalent charges, AQZ-method based on semiseparable matrices, A numerical method for determining monotonicity and convergence rate in iterative learning control, Fast QR factorization of Cauchy-like matrices, Neville elimination for rank-structured matrices, Rational \(QR\)-iteration without inversion, Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations, Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations, On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form, Implicit double shift \(QR\)-algorithm for companion matrices, Structured eigenvalue condition numbers for parameterized quasiseparable matrices, Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions, Fast algorithms for hierarchically semiseparable matrices, On the Description and Stability of Orthogonal Transformations of Rank Structured Matrices, A multiple shift \(QR\)-step for structured rank matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices
- On the shifted QR iteration applied to companion matrices
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- An implicit QR algorithm for symmetric semiseparable matrices
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- A note on the representation and definition of semiseparable matrices
- Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
