Quasi-kernel polynomials and their use in non-Hermitian matrix iterations

DOI10.1016/0377-0427(92)90263-WzbMath0760.65029OpenAlexW1993531511MaRDI QIDQ1195726

Roland W. Freund

Publication date: 18 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-0427(92)90263-w

zbMATH Keywords

orthogonal polynomialsnumerical examplesrecurrence relationnon-Hermitian matricesgeneralized minimal residual methodquasi-minimal residual methodeigenvalue approximationsmatrix iterationsnon-Hermitian matrix iterationsquasi- kernel polynomialsroots of quasi- kernel polynomials

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computation of special functions and constants, construction of tables (65D20) Kernel functions in one complex variable and applications (30C40)

Related Items

A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity ⋮ A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ A note on the convergence behavior of GMRES ⋮ Harmonic projection methods for large non-symmetric eigenvalue problems ⋮ A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides ⋮ Unnamed Item ⋮ Abstract perturbed Krylov methods ⋮ The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited ⋮ A Note on Inexact Inner Products in GMRES ⋮ Usage of the convergence test of the residual norm in the Tsuno-Nodera version of the GMRES algorithm ⋮ On the block GMRES method with deflated restarting ⋮ Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems ⋮ Deflated GMRES for systems with multiple shifts and multiple right-hand sides ⋮ A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems ⋮ GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem ⋮ Complementary cycles of restarted GMRES ⋮ The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors ⋮ Restarted block-GMRES with deflation of eigenvalues ⋮ A note on harmonic Ritz values and their reciprocals ⋮ Convergence properties of block GMRES and matrix polynomials ⋮ Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm ⋮ Polynomial Preconditioned Arnoldi with Stability Control ⋮ Eigenvalue computation in the 20th century ⋮ Analysis of acceleration strategies for restarted minimal residual methods ⋮ On the use of harmonic Ritz pairs in approximating internal eigenpairs ⋮ The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices ⋮ A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm

Uses Software

• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimum iterative method for solving any linear system with a square matrix
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Polynômes orthogonaux formels - applications
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
• Computing the Roots of Complex Orthogonal and Kernel Polynomials
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• An Algorithm for Generalized Matrix Eigenvalue Problems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Methods of conjugate gradients for solving linear systems