Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
DOI10.1016/0045-7825(94)00704-QzbMath0852.73060OpenAlexW2136177191WikidataQ57724596 ScholiaQ57724596MaRDI QIDQ1913232
John F. Abel, Shang-Hsien Hsieh, Glaucio H. Paulino
Publication date: 24 November 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)00704-q
algebraic connectivity vectorgraph partitioning approachgraph representation of finite element meshes
Finite element methods applied to problems in solid mechanics (74S05) Parallel numerical computation (65Y05)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A MIMD implementation of a parallel Euler solver for unstructured grids
- Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers
- Parallel concepts in graph theory
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Eigenvalues of the Laplacian of a graph∗
- Parallel processing of central difference transient analysis for three-dimensional nonlinear framed structures
- Parallel processing for transient nonlinear structural dynamics of three-dimensional framed structures using domain decomposition
- Hierarchically parallelized constrained nonlinear solvers with automated substructuring
- Eigenvectors of acyclic matrices
- A two‐step approach to finite element ordering
- The use of ADINA for analysis of mines with explosive fills
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
This page was built for publication: Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis