Using implicitly filtered RKS for generalised eigenvalue problems

DOI10.1016/S0377-0427(99)00089-8zbMath0944.65038MaRDI QIDQ1300714

Gorik De Samblanx, Adhemar Bultheel

Publication date: 13 September 2000

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvectoreigenvalue problemKrylov subspace methodArnoldi methodSchur decomposition

Mathematics Subject Classification ID

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

Related Items (3)

A projection method for generalized eigenvalue problems using numerical integration. ⋮ A Rational QZ Method ⋮ Generalized Rational Krylov Decompositions with an Application to Rational Approximation

Uses Software

• JDQR
• ARPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rational Krylov sequence methods for eigenvalue computation
• Computing interior eigenvalues of large matrices
• An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems
• Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
• Numerical solution of large nonsymmetric eigenvalue problems
• The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
• The implicit application of a rational filter in the RKS method
• Implicitly restarted Arnoldi with purification for the shift-invert transformation
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
• Perturbation Analyses for the QR Factorization
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems

This page was built for publication: Using implicitly filtered RKS for generalised eigenvalue problems