Six-color procedure for the parallel solution of elliptic systems using the finite quadtree structures. Rept. for Mar-Nov 90

Technical Report · Mon Jan 01 00:00:00 EST 1990

OSTI ID:5791141

Benantar, M; Flaherty, J E

We consider the parallel assembly and solution on shared-memory computers of linear algebraic systems arising from the finite element discretization of two-dimensional linear self-adjoint elliptic problems. Stiffness matrix assembly and conjugate gradient solution of the linear system using element-by-element and symmetric successive over-relaxation preconditioners are processed in parallel with computations scheduled on noncontiguous regions in order to minimize process synchronization. An underlying quadtree structure, used for automatic mesh generation and solution-based mesh refinement, is separated into disjoint regions called quadrants using six-color procedure having linear time complexity.

• Research Organization: Rensselaer Polytechnic Inst., Troy, NY (USA). Dept. of Computer Science
• OSTI ID: 5791141
• Report Number(s): AD-A-230800/5/XAB; CNN: DAAL03-86-K-0112
• Resource Relation: Other Information: Pub. in Proceedings of the SIAM Conference on Parallel Processing for Scientific Computing (4th), p231-236 1990
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
ALGORITHMS
ALGEBRA
AUTOMATION
COMPUTER CALCULATIONS
DECISION TREE ANALYSIS
DESIGN
FINITE ELEMENT METHOD
LINEAR PROGRAMMING
MATRIX ELEMENTS
MEMORY DEVICES
MEMORY MANAGEMENT
MESH GENERATION
PROGRAMMING
SYNCHRONIZATION
MATHEMATICAL LOGIC
MATHEMATICS
NUMERICAL SOLUTION
990200* - Mathematics & Computers