2015
DOI: 10.1016/j.finel.2015.06.005
|View full text |Cite
|
Sign up to set email alerts
|

Efficient matrix-free GPU implementation of Fixed Grid Finite Element Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
20
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 29 publications
(21 citation statements)
references
References 47 publications
1
20
0
Order By: Relevance
“…It was shown in the context of elasticity problems that synchronization overhead from graph coloring is more costly than the unfavorable memory access patterns which it prevents, especially for 3D problems. Martínez-Frutos and Herrero-Pérez further explored the DbD method for elasticity problems on a fixed grid mesh so that only one local finite element matrix is required [20]. By varying material coefficients at the element level, between a constant "inside" and zero "outside", different domain geometries were enforced on the same mesh.…”
Section: Background and Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…It was shown in the context of elasticity problems that synchronization overhead from graph coloring is more costly than the unfavorable memory access patterns which it prevents, especially for 3D problems. Martínez-Frutos and Herrero-Pérez further explored the DbD method for elasticity problems on a fixed grid mesh so that only one local finite element matrix is required [20]. By varying material coefficients at the element level, between a constant "inside" and zero "outside", different domain geometries were enforced on the same mesh.…”
Section: Background and Motivationmentioning
confidence: 99%
“…The construction of a Jacobi preconditioner is a straightforward process that lends itself to element-wise parallel computation. We note that the development of preconditioners that can be computed on a GPU is an active area of research [20,8], but is not a focus of the present study. A comparison of this strategy with a serial implementation having a stronger preconditioner is made in Section 5.3.…”
Section: Preconditioned Conjugate Gradientmentioning
confidence: 99%
“…The use of GPU computing for solving the system of equations of linear elasticity problems using matrix-free and Jacobi PCG methods already has shown its advantages for FGFEA in [38]. In this work, the performance of the solving stage is evaluated using a matrix-free PCG method with two different precon- foreach i = 1 :…”
Section: Fixed-grid Finite Element Analysis (Fgfea)mentioning
confidence: 99%
“…The use of a regular grid permits to calculate and store the common elemental stiffness matrix at the finest grid K e 0 only once at the beginning of the optimization, whereas the global matrix K at the finest grid can be calculated "on-the-fly" using the design fraction of elements d for each analysis. This reduces meaningfully the use of device memory and permits to exploit the data locality [38]. Such an approach is enough for the Jacobi preconditioning but the geometric multigrid preconditioner requires the assembled coefficients at the coarser levels, which are computationally intensive to calculate "on-the-fly" and require significant memory resources when they are stored.…”
Section: Fixed-grid Finite Element Analysis (Fgfea)mentioning
confidence: 99%
See 1 more Smart Citation