Chebyshev-type methods and preconditioning techniques

Chebyshev-type methods and preconditioning techniques

0.00 Avg rating0 Votes
Article ID: iaor20117442
Volume: 218
Issue: 2
Start Page Number: 260
End Page Number: 270
Publication Date: Sep 2011
Journal: Applied Mathematics and Computation
Authors: , , , ,
Keywords: heuristics, programming: linear
Abstract:

Recently, a Newton’s iterative method is attracting more and more attention from various fields of science and engineering. This method is generally quadratically convergent. In this paper, some Chebyshev‐type methods with the third order convergence are analyzed in detail and used to compute approximate inverse preconditioners for solving the linear system Ax = b. Theoretic analysis and numerical experiments show that Chebyshev’s method is more effective than Newton’s one in the case of constructing approximate inverse preconditioners.

Reviews

Required fields are marked *. Your email address will not be published.