Restarted Hessenberg method for solving shifted nonsymmetric linear systems

Abstract

It is known that the restarted full orthogonalization method (FOM) outperforms the restarted generalized minimum residual (GMRES) method in several circumstances for solving shifted linear systems when the shifts are handled simultaneously. Many variants of them have been proposed to enhance their performance. We show that another restarted method, the restarted Hessenberg method [M. Heyouni, Méthode de Hessenberg Généralisée et Applications, Ph.D. Thesis, Université des Sciences et Technologies de Lille, France, 1996] based on Hessenberg procedure, can effectively be employed, which can provide accelerating convergence rate with respect to the number of restarts. Theoretical analysis shows that the new residual of shifted restarted Hessenberg method is still collinear with each other. In these cases where the proposed algorithm needs less enough CPU time elapsed to converge than the earlier established restarted shifted FOM, weighted restarted shifted FOM, and some other popular shifted iterative solvers based on the short-term vector recurrence, as shown via extensive numerical experiments involving the recent popular applications of handling the time fractional differential equations.

arXiv comment19 pages, 7 tables. Some corrections for updating the references

References in corpus (9)

• Many Masses on One Stroke: Economic Computation of Quark Propagators
• Krylov space solvers for shifted linear systems
• Deflated GMRES for Systems with Multiple Shifts and Multiple Right-Hand Sides
• Linear Algebraic Calculation of Green's function for Large-Scale Electronic Structure Theory
• Krylov Subspace Recycling for Sequences of Shifted Linear Systems
• A Flexible Krylov Solver for Shifted Systems with Application to Oscillatory Hydraulic Tomography
• An iterative method to compute the overlap Dirac operator at nonzero chemical potential
• A Fast Algorithm for Parabolic PDE-based Inverse Problems Based on Laplace Transforms and Flexible Krylov Solvers
• Preconditioning the Restarted and Shifted Block FOM Algorithm for Matrix Exponential Computation

Cited by in corpus (3)

• A flexible and adaptive Simpler GMRES with deflated restarting for shifted linear systems
• A Hessenberg-type Algorithm for Computing PageRank Problems
• Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously