Abstract
The problem of determining fast iterative solutions of certain large, sparse, and nonsymmetric linear systems, arising in applications, is addressed here. Several iterative schemes, from the accelerated overrelaxation family, are considered. Different geometrical algorithms are used for the explicit determination of the optimal factors. Direct comparisons of the spectral radii of the resulting optimal schemes reveal that the optimal extrapolated accelerated Gauss-Seidel (EAGS) is always asymptotically faster than the optimal successive overrelaxation, while the optimal EAGS and extrapolated Gauss-Seidel strongly compete. Application of the collocation method on simple boundary-value problems is used to demonstrate our results numerically.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.