A new framework for implicit restarting of the Krylov-Schur algorithm.

DOI10.1002/NLA.1944MaRDI QIDQ2948097zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

eigenvaluesnumerical experimentsRitz valuesRayleigh quotientArnoldi algorithmpolynomial filtereigenvalue assignmentQR algorithmimplicit restartKrylov-Schur algorithmMatrixMarket

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• A Krylov--Schur algorithm for large eigenproblems
• A multishift Hessenberg method for pole assignment of single-input systems
• An algorithm for pole assignment of time invariant linear systems†
• An analysis of the pole placement problem I: The single-input case
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• Arnoldi-Faber method for large non Hermitian eigenvalue problems
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned
• Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
• 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
• Fast Leja points
• Forward Instability of Tridiagonal QR
• IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• On the use of larger bulges in the QR algorithm
• Pole placement preconditioning
• The Arnoldi eigenvalue iteration with exact shifts can fail
• The Matrix Eigenvalue Problem
• The transmission of shifts and shift blurring in the QR algorithm

Cited in

(2)

• A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems.
• Generalized Rational Krylov Decompositions with an Application to Rational Approximation

Describes a project that uses

Uses Software

• IRAM
• MatrixMarket
• eigs

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)