Corrigendum: Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem

DOI10.1145/174603.174406zbMath0894.65017OpenAlexW2007302083WikidataQ113310487 ScholiaQ113310487MaRDI QIDQ4371564

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

Publication date: 25 January 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/1994-20/

zbMATH Keywords

divide and conquer algorithmunitary eigenproblem

Mathematics Subject Classification ID

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

Related Items (7)

An inexact Krylov-Schur algorithm for the unitary eigenvalue problem ⋮ Polynomial zerofinders based on Szegő polynomials ⋮ Perturbation and interlace theorems for the unitary eigenvalue problem ⋮ Algorithm 730 ⋮ Continuation methods for the computation of zeros of Szegő polynomials ⋮ Anti-Szego quadrature rules ⋮ A CS decomposition for orthogonal matrices with application to eigenvalue computation

Uses Software

• UDC

This page was built for publication: Corrigendum: Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem