An implementation of a divide and conquer algorithm for the unitary eigen problem

DOI10.1145/131766.131770zbMath0892.65025OpenAlexW2049355396WikidataQ113310637 ScholiaQ113310637MaRDI QIDQ4371804

Gregory S. Ammar, Danny C. Sorensen, Lothar Reichel

Publication date: 9 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1992-18/

zbMATH Keywords

numerical exampleseigenvaluesparallel computationeigenvectorsfast algorithmQR algorithmHessenberg matrixdivide-and-conquer methodFORTRAN program

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (15)

Trigonometric orthogonal systems and quadrature formulae ⋮ Szegő-Lobatto quadrature rules ⋮ Orthogonal matrix polynomials and applications ⋮ Error bounds in the isometric Arnoldi process ⋮ An inexact Krylov-Schur algorithm for the unitary eigenvalue problem ⋮ Eigenvalue computation for unitary rank structured matrices ⋮ A case against a divide and conquer approach to the nonsymmetric eigenvalue problem ⋮ Polynomial zerofinders based on Szegő polynomials ⋮ Sampling the eigenvalues of random orthogonal and unitary matrices ⋮ Optimally Conditioned Vandermonde-Like Matrices ⋮ On the construction of Szegő polynomials ⋮ Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations ⋮ Continuation methods for the computation of zeros of Szegő polynomials ⋮ A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices ⋮ The restarted QR-algorithm for eigenvalue computation of structured matrices

Uses Software

• EISPACK
• UDC

This page was built for publication: An implementation of a divide and conquer algorithm for the unitary eigen problem