A divide and conquer method for unitary and orthogonal eigenproblems

DOI10.1007/BF01386438zbMath0708.65039OpenAlexW1982197842WikidataQ56814022 ScholiaQ56814022MaRDI QIDQ920577

William B. Gragg, Lothar Reichel

Publication date: 1990

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133476

zbMATH Keywords

orthogonal matricesparallel computerdivide and conquer methodunitary eigenvalue problem

Mathematics Subject Classification ID

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

Related Items (34)

Markov's theorem for weight functions on the unit circle ⋮ Sensitivity analysis for Szegő polynomials ⋮ Computations with quasiseparable polynomials and matrices ⋮ Trigonometric orthogonal systems and quadrature formulae ⋮ Szegő-Lobatto quadrature rules ⋮ A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices ⋮ Refined interlacing properties for zeros of paraorthogonal polynomials on the unit circle ⋮ Orthogonal matrix polynomials and applications ⋮ A new method for computing the stable invariant subspace of a real Hamiltonian matrix ⋮ Error bounds in the isometric Arnoldi process ⋮ A numerical comparison of methods for solving secular equations ⋮ Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines ⋮ The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure ⋮ A generalized unitary Hessenberg matrix ⋮ A unifying convergence analysis of second-order methods for secular equations ⋮ Schur parameter pencils for the solution of the unitary eigenproblem ⋮ An inexact Krylov-Schur algorithm for the unitary eigenvalue problem ⋮ Analysis of third-order methods for secular equations ⋮ Eigenvalue computation for unitary rank structured matrices ⋮ Polynomial zerofinders based on Szegő polynomials ⋮ Sampling the eigenvalues of random orthogonal and unitary matrices ⋮ On monotonicity of zeros of paraorthogonal polynomials on the unit circle ⋮ Structured Eigenvalue Problems ⋮ Generalized averaged Szegő quadrature rules ⋮ Optimally Conditioned Vandermonde-Like Matrices ⋮ On the construction of Szegő polynomials ⋮ On an inverse eigenvalue problem for unitary Hessenberg matrices ⋮ Perturbation and interlace theorems for the unitary eigenvalue problem ⋮ Continuation methods for the computation of zeros of Szegő polynomials ⋮ An interior-point method for large constrained discrete ill-posed problems ⋮ Minimal representations of unitary operators and orthogonal polynomials on the unit circle ⋮ Anti-Szego quadrature rules ⋮ A CS decomposition for orthogonal matrices with application to eigenvalue computation ⋮ The restarted QR-algorithm for eigenvalue computation of structured matrices

Cites Work

• Unnamed Item
• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• The QR algorithm for unitary Hessenberg matrices
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications

This page was built for publication: A divide and conquer method for unitary and orthogonal eigenproblems