Abstract
A linear constraint equation arising from the 3+1 description of general relativity has been solved using both a standard Successive-Over-Relaxation (SOR) scheme and a Multi-Grid (MG) algorithm. In a comparison of computer timings we show that MG can reach a specified convergence criterion nearly 10 times faster than SOR for grids of ∼ 64 × 64 zones, where this factor increases with grid size. In addition it is shown that iterating to a specified convergence criterion can result in wasted work since the truncation error of the solution can be reached well before such a criterion is satisfied. Since MG provides estimates of the solution errors we can assess the minimal amoun of work required to solve the problem. Then it is found that our equation can be solved on a 256 × 256 zones grid using MG in approximately the same time as SOR would need for a ∼ 25 × 25 zones grid if a usual convergence criterion were employed.
Sign-in/Register to access full text options 
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.
