A new framework for implicit restarting of the Krylov-Schur algorithm.
DOI10.1002/NLA.1944zbMATH Open1363.65059OpenAlexW1857579541WikidataQ112878892 ScholiaQ112878892MaRDI QIDQ2948097FDOQ2948097
Authors: 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
Recommendations
- A Krylov--Schur algorithm for large eigenproblems
- Implicitly restarted Arnoldi methods and subspace iteration
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
- Block Krylov-Schur method for large symmetric eigenvalue problems
eigenvaluesnumerical experimentsRitz valuesRayleigh quotientArnoldi algorithmpolynomial filtereigenvalue assignmentQR algorithmimplicit restartKrylov-Schur algorithmMatrixMarket
Cites Work
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Title not available (Why is that?)
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A Krylov--Schur algorithm for large eigenproblems
- The Matrix Eigenvalue Problem
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- The Arnoldi eigenvalue iteration with exact shifts can fail
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- An algorithm for pole assignment of time invariant linear systems†
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- An analysis of the pole placement problem I: The single-input case
- Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned
- Fast Leja points
- Eigenvalue translation based preconditioners for the GMRES(k) method
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- Forward Instability of Tridiagonal QR
- The transmission of shifts and shift blurring in the QR algorithm
- Pole placement preconditioning
- On the use of larger bulges in the QR algorithm
- A multishift Hessenberg method for pole assignment of single-input systems
Cited In (2)
Uses Software
This page was built for publication: A new framework for implicit restarting of the Krylov-Schur algorithm.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948097)
