On some classes of structured matrices with algebraic trigonometric eigenvalues
From MaRDI portal
Publication:544056
DOI10.1016/j.amc.2011.02.032zbMath1218.65036MaRDI QIDQ544056
Publication date: 14 June 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.032
65F18: Numerical solutions to inverse eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity algorithms for semiseparable matrices
- On a new class of structured matrices
- Fast inversion algorithms for diagonal plus semiseparable matrices
- Linear complexity algorithm for semiseparable matrices
- Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
- On polynomials with simple trigonometric formulas
- Neville elimination for rank-structured matrices
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
- The Matrix Eigenvalue Problem