Weyl's quadtree algorithm for the unsymmetric eigenvalue problem

DOI10.1016/0893-9659(95)00072-XMaRDI QIDQ1904521zbMATH OpenOpenAlexFDO

Authors Victor Y. Pan

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)

Recommendations

• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• Improving the solution of the symmetric eigenvalue problem and an extension
• The WZ algorithm for the eigenvalue problem of complex matrix
• The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
• scientific article; zbMATH DE number 741157

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• Numerical Linear Algebra

Cited in

(3)

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

This page was built for publication: Weyl's quadtree algorithm for the unsymmetric eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904521)