A Preconditioner for the Restarted GMRES Method
Tong Kai-yu
Abstract
Tong Kai-yu
Abstract
The restarted GMRES algorithm proposed by Saad and Schultz is one of the most popular iterative methods for the solution of large linear systems.This algorithm is particularly attractive when a good preconditioner is obtained.This paper describes a new method for determining preconditioners.Numerical results indicate that the new preconditioner is very effective.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The restarted GMRES algorithm proposed by Saad and Schultz is one of the most popular iterative methods for the solution of large linear systems.This algorithm is particularly attractive when a good preconditioner is obtained.This paper describes a new method for determining preconditioners.Numerical results indicate that the new preconditioner is very effective.
Key concepts: Preconditioner, Generalized minimal residual method, Iterative method, Linear system, Computer science, Applied mathematics, Mathematics, Mathematical optimization