Abstract
We describe an application of the multigrid iteration to the collocation approximation for elliptic equations using a bicubic Hermite basis. A block relaxation and a projection operator specific to the collocation approximation were required to obtain convergence. We illustrate the method with the two-point boundary problem: Results are also given for an elliptic problem in two dimensions. Comments on computational efficiency are given along with operational counts. Results for a block SOR algorithm are also given. Comparison with a multigrid finite difference method indicates that the collocation method is less efficient.
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.
