Abstract
The complete multi-grid process will be developed in three stages (§ 3: two-grid iteration, § 4: multi-grid iteration, § 5: nested iteration). The two-grid algorithm serves only as an (impractical) illustration preparing for the multi-grid method which might seem intricate if introduced at once. Although the multi-grid iteration of § 4 is already effective, it can still be improved by the nested iteration (§ 5).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hackbusch, W. (1985). General Two-Grid Method. In: Multi-Grid Methods and Applications. Springer Series in Computational Mathematics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02427-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-02427-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05722-9
Online ISBN: 978-3-662-02427-0
eBook Packages: Springer Book Archive