A divide and conquer method for unitary and orthogonal eigenproblems

The authors describe a divide and conquer method for a unitary eigenvalue problem which is suitable for implementation on a parallel computer. The simplifications that arise for real orthogonal matrices are also discussed.

Recommendations

A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
An implementation of a divide and conquer algorithm for the unitary eigen problem
scientific article; zbMATH DE number 278836
scientific article; zbMATH DE number 4155755
On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques

Cites work

A Divide and Conquer method for the symmetric tridiagonal eigenproblem
Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
scientific article; zbMATH DE number 3451330 (Why is no real title available?)
On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
The QR algorithm for unitary Hessenberg matrices

Cited in

(40)

An interior-point method for large constrained discrete ill-posed problems
Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines
Schur parameter pencils for the solution of the unitary eigenproblem
On parallelizable eigensolvers
Perturbation and interlace theorems for the unitary eigenvalue problem
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
On the construction of Szegő polynomials
On an inverse eigenvalue problem for unitary Hessenberg matrices
The restarted QR-algorithm for eigenvalue computation of structured matrices
Orthogonal matrix polynomials and applications
Sampling the eigenvalues of random orthogonal and unitary matrices
Markov's theorem for weight functions on the unit circle
On monotonicity of zeros of paraorthogonal polynomials on the unit circle
A CS decomposition for orthogonal matrices with application to eigenvalue computation
Computations with quasiseparable polynomials and matrices
Trigonometric orthogonal systems and quadrature formulae
A generalized unitary Hessenberg matrix
Eigenvalue computation for unitary rank structured matrices
Continuation methods for the computation of zeros of Szegő polynomials
Minimal representations of unitary operators and orthogonal polynomials on the unit circle
Anti-Szego quadrature rules
scientific article; zbMATH DE number 4155755 (Why is no real title available?)
Structured Eigenvalue Problems
On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
An implementation of a divide and conquer algorithm for the unitary eigen problem
Analysis of third-order methods for secular equations
A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
Refined interlacing properties for zeros of paraorthogonal polynomials on the unit circle
Optimally Conditioned Vandermonde-Like Matrices
A unifying convergence analysis of second-order methods for secular equations
Polynomial zerofinders based on Szegő polynomials
The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure
The eigenvalue decomposition of normal matrices by the skew-symmetric part
Generalized averaged Szegő quadrature rules
Sensitivity analysis for Szegő polynomials
Szegő-Lobatto quadrature rules
A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices
An inexact Krylov-Schur algorithm for the unitary eigenvalue problem

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

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