Abstract
The proposed algorithm represents an efficient parallel implementation of the Fedorenko multigrid method and is intended for solving three-dimensional elliptic equations. Scalability is provided by the use of the Chebyshev iterations for solution of the coarsest grid equations and for construction of the smoothing procedures. The calculation results are given: they confirm the efficiency of the algorithm and scalability of the parallel code.
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.
