An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
From MaRDI portal
Recommendations
- A Krylov--Schur algorithm for large eigenproblems
- A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
- Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Schur parameter pencils for the solution of the unitary eigenproblem
Cites work
- scientific article; zbMATH DE number 1805736 (Why is no real title available?)
- scientific article; zbMATH DE number 3883507 (Why is no real title available?)
- scientific article; zbMATH DE number 3451330 (Why is no real title available?)
- A Krylov--Schur algorithm for large eigenproblems
- A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
- A divide and conquer method for unitary and orthogonal eigenproblems
- An Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix
- An implementation of a divide and conquer algorithm for the unitary eigen problem
- Bestimmung der Eigenwerte orthogonaler Matrizen
- Chasing Algorithms for the Eigenvalue Problem
- Convergence of the Isometric Arnoldi Process
- Corrigendum: Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- Random matrix theory
- Schur parameter pencils for the solution of the unitary eigenproblem
- The QR algorithm for unitary Hessenberg matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Thick-restart Lanczos method for large symmetric eigenvalue problems
Cited in
(5)- scientific article; zbMATH DE number 5772902 (Why is no real title available?)
- A new framework for implicit restarting of the Krylov-Schur algorithm.
- Krylov-Schur-type restarts for the two-sided Arnoldi method
- Schur parameter pencils for the solution of the unitary eigenproblem
- A periodic Krylov-Schur algorithm for large matrix products
This page was built for publication: An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935390)
