𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel complexity of domain decomposition methods and optimal coarse grid size

✍ Scribed by Tony F. Chan; Jian Ping Shao

Book ID
107919376
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
1023 KB
Volume
21
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Domain decomposition methods for paralle
Domain decomposition methods for parallel solution of shape sensitivity analysis problems
✍ Manolis Papadrakakis; Yiannis Tsompanakis πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 376 KB πŸ‘ 3 views

This paper presents the implementation of advanced domain decomposition techniques for parallel solution of large-scale shape sensitivity analysis problems. The methods presented in this study are based on the FETI method proposed by Farhat and Roux which is a dual domain decomposition implementatio

A parallel domain decomposition method f
A parallel domain decomposition method for coupling of surface and groundwater flows
✍ Bin Jiang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 301 KB

## a b s t r a c t In this paper, we construct a robust parallel method based on a recently developed non-overlapping domain decomposition methodology to accurately model natural coupling of surface and groundwater flows. Stokes and Darcy equations are formulated and solved within the surface and s

Incorporation of multipoint constraints
Incorporation of multipoint constraints into the balancing domain decomposition method and its parallel implementation
✍ Tomoshi Miyamura πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 354 KB

## Abstract The domain decomposition method (DDM) is a major solution algorithm that is used to parallelize the finite element method. In the case of implicit structural analysis using the DDM, the substructuring‐based iterative linear solver is a powerful tool when an effective preconditioner such