Abstract
AbstractIn the past, most finite element algorithms on data‐parallel computers have been limited to structured problem domains. Here, we consider methods to generalize the finite element method on data‐parallel architectures to unstructured domains. A nodal assembly algorithm is described which effectively allows for both the generation of the sparse interaction matrix (coefficient matrix) and its solution via a preconditioned conjugate‐gradient type routine utilizing several polynomial preconditioners on the Connection Machine 200 (CM‐200). Jacobi preconditioning along with Neumann series and least‐squares polynomial preconditioners are presented and implemented are presented and implemented. Only the Jacobi preconditioner produces an improvement in the convergence time for the problems examined. Several irregular interprocessor communication protocols available on the CM‐200 are investigated in the solution portion of the algorithm, yielding differing performance characteristics. For one such protocol, sustained performance of over two‐hundred MFlops/s, is demonstrated for a test problem on a 512 processing element CM‐200 in slicewise mode. The results are discussed and conclusions are drawn concerning this finite element algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal for Numerical Methods in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
