Eigen-solving via reduction to DPR1 matrices
From MaRDI portal
Publication:950043
DOI10.1016/j.camwa.2007.09.012zbMath1145.65311OpenAlexW2072061930MaRDI QIDQ950043
Xinmao Wang, Pan, Victor Y., Brian Murphy, Ai-Long Zheng, Rhys Eric Rosholt, Yuqing Tang
Publication date: 22 October 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2007.09.012
Related Items
Cites Work
- Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
- Additive preconditioning, eigenspaces, and the inverse iteration
- On inverses of Hessenberg matrices
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Additive preconditioning and aggregation in matrix computations
- Linking the TPR1, DPR1 and arrow-head matrix structures
- Matrix Algorithms
- A note on the representation and definition of semiseparable matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- Unnamed Item
- Unnamed Item
- Unnamed Item