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: | Zhang Yong, Li Hou-Biao, Huang Ting-Zhu, Liu Xing-Ping, Gu Tong-Xiang |
Keywords: | heuristics, programming: linear |
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