A new framework for implicit restarting of the Krylov-Schur algorithm
From MaRDI portal
Publication:2948097
DOI10.1002/nla.1944zbMath1363.65059OpenAlexW1857579541WikidataQ112878892 ScholiaQ112878892MaRDI QIDQ2948097
Zvonimir Bujanović, Zlatko Drmač
Publication date: 29 September 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1944
eigenvaluesnumerical experimentsRayleigh quotientRitz valuesimplicit restartArnoldi algorithmeigenvalue assignmentQR algorithmpolynomial filterKrylov-Schur algorithmMatrixMarket
Related Items
A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems, Generalized Rational Krylov Decompositions with an Application to Rational Approximation
Uses Software
Cites Work
- Unnamed Item
- Fast Leja points
- An analysis of the pole placement problem I: The single-input case
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- Pole placement preconditioning
- The transmission of shifts and shift blurring in the QR algorithm
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- On the use of larger bulges in the QR algorithm
- A Krylov--Schur Algorithm for Large Eigenproblems
- A multishift Hessenberg method for pole assignment of single-input systems
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- An algorithm for pole assignment of time invariant linear systems†
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Forward Instability of Tridiagonal QR
- Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Eigenvalue translation based preconditioners for the GMRES(k) method
- The Arnoldi Eigenvalue Iteration with Exact Shifts Can Fail
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- The Matrix Eigenvalue Problem
