An efficient communications strategy for finite element methods on the Connection Machine CM-5 system
DOI10.1016/0045-7825(94)90054-XzbMath0846.76046OpenAlexW1990869220MaRDI QIDQ1912133
S. Lennart Johnsson, Thomas J. R. Hughes, Kapil K. Mathur, Zdeněk Johan
Publication date: 10 June 1996
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7825(94)90054-x
recursive spectral bisection algorithmdistributed-memory parallel computerslarge-scale three-dimensional problemsnode renumbering schemeunstructured finite element solvers
Finite element methods applied to problems in fluid mechanics (76M10) Parallel numerical computation (65Y05)
Related Items (14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new finite element formulation for computational fluid dynamics. VIII. The Galerkin/least-squares method for advective-diffusive equations
- A MIMD implementation of a parallel Euler solver for unstructured grids
- A new finite element formulation for computational fluid dynamics. I: Symmetric forms of the compressible Euler and Navier-Stokes equations and the second law of thermodynamics
- A new finite element formulation for computational fluid dynamics. III: The generalized streamline operator for multidimensional advective- diffusive systems
- A new finite element formulation for computational fluid dynamics. VI. Convergence analysis of the generalized SUPG formulation for linear time- dependent multidimensional advective-diffusive systems
- A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids
- A data parallel finite element method for computational fluid dynamics on the Connection Machine system
- A multi-element group preconditioned GMRES algorithm for nonsymmetric systems arising in finite element analysis
- Application of polycrystal plasticity to sheet forming
- DYNAMIC FINITE ELEMENT SIMULATIONS ON THE CONNECTION MACHINE
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- On Estimating the Largest Eigenvalue with the Lanczos Algorithm
- Eigenvectors of acyclic matrices
- Design and implementation of a parallel unstructured Euler solver using software primitives
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
This page was built for publication: An efficient communications strategy for finite element methods on the Connection Machine CM-5 system