Object-oriented programming of distributed iterative equation solvers

Mackie, R. I.

doi:10.1016/j.compstruc.2007.05.003

Cited by 3 publications

(3 citation statements)

References 20 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further parallelisati on can be achieved by using domain decompo sition. The paper described the use of a design pattern which has also been used in the design of software for iterative solvers [17]. The work described in [18] has been modified to use the TPL, but the overall design remains the same.…”

Section: Parallelising Of Individual Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic analysis of structures on multicore computers – Achieving efficiency through object oriented design

Mackie

2013

Advances in Engineering Software

View full text Add to dashboard Cite

Section: Parallelising Of Individual Algorithmsmentioning

confidence: 99%

“…Since the focus of the current work is on software design aspects, the work in the current paper is limited to the linear case. The Hilber-Hughes-Taylor algorithm is used, and the design pattern used for eigensolution and iterative solvers [16,17] is adopted.…”

Section: Parallelising Of Individual Algorithmsmentioning

confidence: 99%

Dynamic analysis of structures on multicore computers – Achieving efficiency through object oriented design

Mackie

2013

Advances in Engineering Software

View full text Add to dashboard Cite

“…Baudron and Lautard (2007) described a neutronic core solver, based on the mixed-dual finite element approximation of the simplified transport equation, and written in Cþþ using an object-oriented design. Mackie (2008) used an object-oriented approach to develop classes and frameworks for the implementation of a distributed iterative equation solver. The software was implemented using the.NET framework, and made good use of interfaces to isolate sources of complexity.…”

Section: Introductionmentioning

confidence: 99%

OpenMp solvers for parallel finite element and meshless analyses

2014

Engineering Computations

View full text Add to dashboard Cite

Purpose – 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. Design/methodology/approach – The stiffness matrix can be symmetrical or unsymmetrical, and the solution schemes include sky-line Cholesky and parallel preconditioned conjugate gradient-like methods. Findings – 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. Practical implications – 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. Originality/value – 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.

show abstract