๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel algorithms for the finite element method

โœ Scribed by Jenn-Ching Luo; Morton B. Friedman


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
888 KB
Volume
16
Category
Article
ISSN
0093-6413

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


EVALUATION OF AUTOMATIC DOMAIN PARTITION
โœ SHANG-HSIEN HSIEH; GLAUCIO H. PAULINO; JOHN F. ABEL ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 460 KB ๐Ÿ‘ 2 views

This paper studies and compares the domain partitioning algorithms presented by Farhat, Al-Nasra and Nguyen, Malone, and Simon/Hsieh et al. for load balancing in parallel finite element analysis. Both the strengths and weaknesses of these algorithms are discussed. Some possible improvements to the p

The iterative group implicit algorithm f
โœ Sukomal Modak; Elisa D. Sotelino ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB ๐Ÿ‘ 2 views

The Iterative Group Implicit (IGI) algorithm is developed for the parallel solution of general structural dynamic problems. In this method the original structure is partitioned into a number of a subdomains. Each subdomain is solved independently and therefore concurrently, using any traditional dir

Parallel Delaunay triangulation for part
โœ Fragakis, Yannis ;Oรฑate, Eugenio ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 259 KB

## Abstract Delaunay triangulation is a geometric problem that is relatively difficult to parallelize. Parallel algorithms are usually characterized by considerable interprocessor communication or important serialized parts. In this paper, we propose a method that achieves high speedโ€ups, but needs

Parallel finite element splitting-up met
โœ Xue-Cheng Tai; Pekka Neittaanmรคki ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 579 KB

An efficient method for solving parabolic systems is presented. The proposed method is based on the splitting-up principle in which the problem is reduced to a series of independent 1D problems. This enables it to be used with parallel processors. We can solve multidimensional problems by applying o

Parallel proximal-point algorithms for m
โœ Alduncin, Gonzalo ;Vera-Guzmรกn, Norberto ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 421 KB ๐Ÿ‘ 1 views

## 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โ€p