Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
From MaRDI portal
Publication:2484224
DOI10.1016/j.laa.2005.02.039zbMath1079.65037OpenAlexW1986168328MaRDI QIDQ2484224
Yu.S.Eidel'man, Vadim Olshevsky, Israel Gohberg
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.039
orthogonal polynomialseigenvalueseigenvectorsrecurrence relationsSchur algorithmtridiagonal matricesquasiseparable matricesSchur-Cohn recursions
Related Items
Computations with quasiseparable polynomials and matrices ⋮ Signal flow graph approach to inversion of \((H,m)\)-quasiseparable-Vandermonde matrices and new filter structures ⋮ A Fractal Eigenvector ⋮ Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices ⋮ Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification ⋮ The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure ⋮ Improved bisection eigenvalue method for band symmetric Toeplitz matrices ⋮ A quasiseparable approach to five-diagonal CMV and Fiedler matrices ⋮ Reprint of: A quasiseparable approach to five-diagonal CMV and Fiedler matrices ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ Representation of quasiseparable matrices using excluded sums and equivalent charges ⋮ The spectral connection matrix for classical orthogonal polynomials of a single parameter ⋮ On some classes of structured matrices with algebraic trigonometric eigenvalues ⋮ Green's matrices ⋮ A multiple shift \(QR\)-step for structured rank matrices ⋮ Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inertia characteristics of self-adjoint matrix polynomials
- Linear complexity algorithms for semiseparable matrices
- The QR algorithm for unitary Hessenberg matrices
- 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
- Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- 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
- 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
- Discrete and continuous boundary problems
- 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
