Parallel assembling and equation solving via graph algorithms with an application to the FE simulation of metal extrusion processes

Authors:
A. Unterkircher;J. Reissner
Affiliations:
CERN, IT Department, 1211 Geneva 23, Switzerland;ETH Zürich, Institut für virtuelle Produktion, Tannenstr. 3, 8092 Zürich, Switzerland
Venue:
Computers and Structures
Year:
2005

Citing 7
Cited 0

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
On vectorizing incomplete factorization and SSOR preconditioners

SIAM Journal on Scientific and Statistical Computing - Telecommunication Programs at U.S. Universities
A parallel graph coloring heuristic

SIAM Journal on Scientific Computing
Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Finite element solution of boundary value problems: theory and computation

Finite element solution of boundary value problems: theory and computation
A distributed memory unstructured gauss-seidel algorithm for multigrid smoothers

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Sourcebook of parallel computing

Sourcebook of parallel computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose methods for parallel assembling and iterative equation solving based on graph algorithms. The assembling technique is independent of dimension, element type and model shape. As a parallel solving technique we construct a multiplicative symmetric Schwarz preconditioner for the conjugate gradient method. Both methods have been incorporated into a non-linear FE code to simulate 3D metal extrusion processes. We illustrate the efficiency of these methods on shared memory computers by realistic examples.