A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem

DOI10.1137/S0895479899359539zbMath1053.65026OpenAlexW1968151527MaRDI QIDQ4443834

Robert Guzzo, Xuebin Chi, Ming Gu, Xing-Qin Cao

Publication date: 19 January 2004

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479899359539

zbMATH Keywords

numerical experimentseigendecompositiondivide and conquer algorithmunitary eigenproblemstable backward method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (13)

Sensitivity analysis for Szegő polynomials ⋮ Trigonometric orthogonal systems and quadrature formulae ⋮ Szegő-Lobatto quadrature rules ⋮ The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure ⋮ An inexact Krylov-Schur algorithm for the unitary eigenvalue problem ⋮ Eigenvalue computation for unitary rank structured matrices ⋮ Generalized averaged Szegő quadrature rules ⋮ Optimally Conditioned Vandermonde-Like Matrices ⋮ Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations ⋮ A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices ⋮ Anti-Szego quadrature rules ⋮ Matrix methods for quadrature formulas on the unit circle. A survey ⋮ A CS decomposition for orthogonal matrices with application to eigenvalue computation

Uses Software

• LAPACK

This page was built for publication: A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem