Abstract

AbstractWe discuss the advantages of using algebraic multigrid based on smoothed aggregation for solving indefinite linear problems. The ingredients of smoothed aggregation are used to construct a black‐box monolithic multigrid method with indefinite coarse problems. Although we discuss some techniques for enforcing the uniform inf‐sup stability on all coarse levels, numerical experiments suggest that it is not strictly necessary. The proposed multigrid preconditioner shows robust behaviour for different time‐step parameters and even for very elongated geometries, where other techniques based on h ‐independent preconditioners of the pressure Schur complement lose their efficiency. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Full Text
Paper version not known

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 call

Disclaimer: 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.