AbstractIn this paper we consider various iterative methods for the numerical solution of very large, sparse linear systems of equations, which arise in the discretization of partial differential equations. As the performance of the methods generally depends on the characteristics of the problems to be solved, a judicious choice between the methods will require knowledge about the system. The aim of this paper is to review the properties of the various iteration methods, in order to assist the user in making a deliberate selection
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.