The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
From MaRDI portal
Publication:2484401
DOI10.1016/J.LAA.2005.02.037zbMATH Open1079.65038OpenAlexW2071077570MaRDI QIDQ2484401FDOQ2484401
Authors: Y. Eidelman, I. Gohberg, V. 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
Recommendations
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Divide and conquer method for eigenstructure of quasiseparable matrices using zeroes of rational matrix functions
- The restarted QR-algorithm for eigenvalue computation of structured matrices
- Numerical solution of the eigenvalue problem for efficiently structured Hermitian matrices
- Eigenvalue computation for unitary rank structured matrices
- A multiple shift \(QR\)-step for structured rank matrices
- An implicit QR algorithm for symmetric semiseparable matrices
- The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure
- AQZ-method based on semiseparable matrices
numerical experimentseigenvalue problemquasi-separable matricessemiseparable matricesQR iterationDewilde-van der Veen methodHermitian separable matrices
Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Title not available (Why is that?)
- An implicit QR algorithm for symmetric semiseparable matrices
- Title not available (Why is that?)
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- On a new class of structured matrices
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- On the shifted QR iteration applied to companion matrices
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
- Linear complexity inversion algorithms for a class of structured matrices
- A note on the representation and definition of semiseparable matrices
- Fast inversion algorithms for diagonal plus semiseparable matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- Title not available (Why is that?)
- Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices
Cited In (30)
- A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
- A numerical method for determining monotonicity and convergence rate in iterative learning control
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices
- AQZ-method based on semiseparable matrices
- Rational \(QR\)-iteration without inversion
- Implicit double shift \(QR\)-algorithm for companion matrices
- Fast QR factorization of Cauchy-like matrices
- Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
- On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
- A fast implicit QR eigenvalue algorithm for companion matrices
- Singular matrices whose Moore-Penrose inverse is tridiagonal
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- Fast algorithms for hierarchically semiseparable matrices
- The restarted QR-algorithm for eigenvalue computation of structured matrices
- Structured condition numbers for Sylvester matrix equation with parameterized quasiseparable matrices
- A multiple shift \(QR\)-step for structured rank matrices
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- On the \(QR\) iterations of real matrices
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- Neville elimination for rank-structured matrices
- SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices
- On the description and stability of orthogonal transformations of rank structured matrices
- Representation of quasiseparable matrices using excluded sums and equivalent charges
- Time and space efficient generators for quasiseparable matrices
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
- A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
- Computations with quasiseparable polynomials and matrices
This page was built for publication: The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484401)
