Weyl's quadtree algorithm for the unsymmetric eigenvalue problem

DOI10.1016/0893-9659(95)00072-XzbMath0833.65029OpenAlexW2145428465MaRDI QIDQ1904521

Pan, Victor Y.

Publication date: 14 March 1996

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(95)00072-x

zbMATH Keywords

polynomial zerosmatrix inverseunsymmetric eigenvalue problemclosest singular matrixWeyl's quadtree algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items

Optimal and nearly optimal algorithms for approximating polynomial zeros, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical Linear Algebra