Abstract
It is well known that iterative methods, utilizing the great speed of modern computers, are extensively used in large-scale computations for solving matrix equations which arise from finite difference approxmations to elliptic partial differential equations. The object of this paper is to introduce a new explicit iterative method suitable for parallel computation for the solution of the associated matrix equations and compare its performance with existing methods (Jacobi, successive over-relaxation). It is hoped that numerical experiments on the simple one-dimensional linear model and its extensions to multi-dimensional problems will serve as an indication of the power of the new (AGE) matrix iterative method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
