Abstract
A class of new hybrid algebraic multilevel preconditioning methods is presented for solving the large sparse systems of linear equations with symmetric positive definite coefficient matrices resulting from the discretization of many second-order elliptic boundary-value problems by the finite-element method. The new preconditioners are shown to be of optimal orders of complexities for two-dimensional and three-dimensional problem domains, and their relative condition numbers are estimated to be bounded uniformly, independent of the numbers of both the levels and the nodes.
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.
