PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 25, 1991International Journal for Numerical Methods in Engineering1,293 citations

A method of finite element tearing and interconnecting and its parallel solution algorithm

View Full Paper
CFCharbel FarhatFRFrançois‐Xavier Roux

Key Points

  • This research aims to develop an efficient method for parallel finite element solutions of equilibrium equations by utilizing domain decomposition.
  • A novel domain decomposition approach partitions the spatial domain into disconnected subdomains for parallel processing.
  • Lagrange multipliers enforce compatibility at the interfaces of subdomains, resolving issues related to local singularities.
  • A parallel conjugate projected gradient algorithm is implemented to solve the coupled system of local modes and multipliers.
  • The proposed method reduces interprocessor communications compared to classical substructuring methods.
  • It demonstrates a level of parallelism not restricted by the bandwidth of finite element equations.
  • The implementation on local memory multiprocessors shows enhanced computational efficiency.

Abstract

Abstract A novel domain decomposition approach for the parallel finite element solution of equilibrium equations is presented. The spatial domain is partitioned into a set of totally disconnected subdomains, each assigned to an individual processor. Lagrange multipliers are introduced to enforce compatibility at the interface nodes. In the static case, each floating subdomain induces a local singularity that is resolved in two phases. First, the rigid body modes are eliminated in parallel from each local problem and a direct scheme is applied concurrently to all subdomains in order to recover each partial local solution. Next, the contributions of these modes are related to the Lagrange multipliers through an orthogonality condition. A parallel conjugate projected gradient algorithm is developed for the solution of the coupled system of local rigid modes components and Lagrange multipliers, which completes the solution of the problem. When implemented on local memory multiprocessors, this proposed method of tearing and interconnecting requires less interprocessor communications than the classical method of substructuring. It is also suitable for parallel/vector computers with shared memory. Moreover, unlike parallel direct solvers, it exhibits a degree of parallelism that is not limited by the bandwidth of the finite element system of equations.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Farhat et al. (1991) studied this question.

synapsesocial.com/papers/69d83d6a8c03fbaff8bee719https://doi.org/10.1002/nme.1620320604
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1On the Mapping Problem1981 · 586 citations
  2. 2Unconditionally stable concurrent procedures for transient finite element analysis1986 · 51 citations
  3. 3Elliptic Problem Solvers II.1986 · 112 citations
  4. 4Tests on parallel machines of a domain decomposition method for a composite three-dimensional structural analysis problem1988 · 4 citations
  5. 5A new finite element concurrent computer program architecture1987 · 94 citations