An inexact Krylov-Schur algorithm for the unitary eigenvalue problem

DOI10.1016/j.laa.2007.09.034zbMath1153.65035OpenAlexW2022567365MaRDI QIDQ935390

David S. Watkins, Roden J. A. David

Publication date: 6 August 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2007.09.034

zbMATH Keywords

Schur parametersimplicit restartArnoldi processunitary matrix

Mathematics Subject Classification ID

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

Related Items (1)

Krylov--Schur-Type Restarts for the Two-Sided Arnoldi Method

Uses Software

• eigs
• TRLan
• IRAM
• Algorithm 730
• UDC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A divide and conquer method for unitary and orthogonal eigenproblems
• The QR algorithm for unitary Hessenberg matrices
• Schur parameter pencils for the solution of the unitary eigenproblem
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• Bestimmung der Eigenwerte orthogonaler Matrizen
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• A Krylov--Schur Algorithm for Large Eigenproblems
• An Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix
• Chasing Algorithms for the Eigenvalue Problem
• Random matrix theory
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Corrigendum: Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem
• An implementation of a divide and conquer algorithm for the unitary eigen problem
• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
• Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
• On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
• Convergence of the Isometric Arnoldi Process
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: An inexact Krylov-Schur algorithm for the unitary eigenvalue problem