Explicit synchronous partitioned algorithms for interface problems based on Lagrange multipliers
Traditional explicit partitioned schemes exchange boundary conditions between subdomains and can be related to iterative solution methods for the coupled problem. As a result, these schemes may require multiple subdomain solves, acceleration techniques, or optimized transmission conditions to achiev...
Saved in:
| Published in | Computers & mathematics with applications (1987) Vol. 78; no. 2; pp. 459 - 482 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Oxford
Elsevier Ltd
15.07.2019
Elsevier BV Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0898-1221 1873-7668 1873-7668 |
| DOI | 10.1016/j.camwa.2018.09.045 |
Cover
| Summary: | Traditional explicit partitioned schemes exchange boundary conditions between subdomains and can be related to iterative solution methods for the coupled problem. As a result, these schemes may require multiple subdomain solves, acceleration techniques, or optimized transmission conditions to achieve sufficient accuracy and/or stability. We present a new synchronous partitioned method derived from a well-posed mixed finite element formulation of the coupled problem. We transform the resulting Differential Algebraic Equation (DAE) to a Hessenberg index-1 form in which the algebraic equation defines the Lagrange multiplier as an implicit function of the states. Using this fact we eliminate the multiplier and reduce the DAE to a system of explicit ODEs for the states. Explicit time integration both discretizes this system in time and decouples its equations. As a result, the temporal accuracy and stability of our formulation are governed solely by the accuracy and stability of the explicit scheme employed and are not subject to additional stability considerations as in traditional partitioned schemes. We establish sufficient conditions for the formulation to be well-posed and prove that classical mortar finite elements on the interface are a stable choice for the Lagrange multiplier. We show that in this case the condition number of the Schur complement involved in the elimination of the multiplier is bounded by a constant. The paper concludes with numerical examples illustrating the approach for two different interface problems. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 SAND-2018-14135J USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) SC-0000230927; AC04-94AL85000 USDOE National Nuclear Security Administration (NNSA) |
| ISSN: | 0898-1221 1873-7668 1873-7668 |
| DOI: | 10.1016/j.camwa.2018.09.045 |