Abstract
I investigate the suitability of the Scheduled-Relaxation-Jacobi method as a smoother within a geometric multilevel (ML) solver. Its performance in the solution of a linear elliptic equation is measured, based on two metrics: absolute performance (measured by the residual reduction in a fixed number of iterations), and parallel scalability. I discuss the theoretical expectations on the effect of this hybrid scheme on the solution iterate and, especially, the solution error, and confirm them numerically.
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.
