OpenMp solvers for parallel finite element and meshless analyses. Issue 1 (2014)

• Record Type: Journal Article
• Authors: S.H. Ju
• Is Part Of: Engineering computations. Volume 31:Issue 1(2014)
• Page Start: 2
• Page End: 17
• Publication Date: 2014
• Subjects: Computer-aided engineering -- Periodicals; Computer graphics -- Periodicals; 620.00285
• DOI: 10.1108/EC-02-2012-0032
• Languages: English
• ISSNs: 0264-4401

Abstract

<abstract> <title> <x xml:space="preserve"> Abstract </x> </title> <p> <bold>Purpose</bold> – This paper develops C++ and Fortran‐90 solvers to establish parallel solution procedures in a finite element or meshless analysis program using shared memory computers. The paper aims to discuss these issues. <bold>Design/methodology/approach</bold> – The stiffness matrix can be symmetrical or unsymmetrical, and the solution schemes include sky‐line Cholesky and parallel preconditioned conjugate gradient‐like methods. <bold>Findings</bold> – By using the features of C++ or Fortran‐90, the stiffness matrix and its auxiliary arrays can be encapsulated into a class or module as private arrays. This class or module will handle how to allocate, renumber, assemble, parallelize and solve these complicated arrays automatically. <bold>Practical implications</bold> – The source codes can be obtained online at http//myweb.ncku.edu.tw/∼juju. The major advantage of the scheme is that it is simple and systematic, so an efficient parallel finite element or meshless program can be established easily. <bold>Originality/value</bold> – With the minimum requirement of computer memory, an object‐oriented C++ class and a Fortran‐90 module were established to allocate, renumber, assemble, parallel, and solve the global stiffness matrix, so that the programmer does not need to handle them directly.</p> </abstract>