Abstract

SummaryThis article presents a new method to recycle the solution space of an adaptive multipreconditioned finite element tearing and interconnecting algorithm in the case where the same operator is solved for multiple right‐hand sides like in linear structural dynamics. It accelerates the computation from the second time step on by applying a coarse space that is generated from Ritz approximations of local eigenproblems, using the solution space of the first time step. These eigenproblems are known to provide very efficient coarse spaces but must usually be solved a priori at high computational cost. Their Ritz approximations are much smaller and less expensive to solve. Recycling methods based on Ritz approximations of global eigenproblems have been published for classical finite element tearing and interconnecting algorithms, but their efficient application to multipreconditioned variants is not possible. This article also presents the application of a simpler recycling procedure, which reuses plain solution spaces, to adaptive multipreconditioned finite element tearing and interconnecting. Numerical results of the application of the presented methods to four test cases are shown. The new Ritz approximation method leads to coarse spaces, which turn out to be as efficient as those obtained from solving the unreduced eigenproblems. It is the most efficient recycling method currently available for multipreconditioned dual domain decomposition techniques.

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.