Parallel proximal-point algorithms for mixed finite element models of flow in the subsurface

✍ Scribed by Alduncin, Gonzalo ;Vera-Guzmán, Norberto

• Publisher: John Wiley and Sons
• Year: 2003
• Tongue: English
• Weight: 421 KB
• Volume: 20
• Category: Article
• ISSN: 1069-8299
• DOI: 10.1002/cnm.647

✦ Synopsis

Abstract

Parallel proximal‐point algorithms for mixed finite element models of flow in the subsurface are presented. The applied methodology corresponds to operator splitting and non‐overlapping domain decomposition methods, combined with resolvent or proximation characterizations and proximal‐point algorithms. In this manner, macro‐hybrid mixed finite element models are systematically derived, in general being globally non‐conforming on the basis of non‐matching grids. Also, iterative algorithms of the Uzawa penalty–duality type are produced, which are well‐conditioned and robust. These parallel iterative algorithms generalize optimization and augmented Lagrangian procedures, and can be interpreted as implicit and semi‐implicit numerical time marching schemes. Copyright © 2004 John Wiley & Sons, Ltd.