Restrictions on implicit filtering techniques for orthogonal projection methods

DOI10.1016/S0024-3795(98)10153-2zbMath0942.65041MaRDI QIDQ1301271

Adhemar Bultheel, Gorik De Samblanx

Publication date: 15 December 1999

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

large eigenvalue problemsKrylov subspace methodArnoldi methodimplicit filteringorthogonal projection methodsrank conservative methods

Mathematics Subject Classification ID

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

Related Items (1)

Restrictions on implicit filtering techniques for orthogonal projection methods

Uses Software

• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Rational Krylov sequence methods for eigenvalue computation
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Restrictions on implicit filtering techniques for orthogonal projection methods
• Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
• 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
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• The Davidson Method
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: Restrictions on implicit filtering techniques for orthogonal projection methods