• Keine Ergebnisse gefunden

A Deflated Conjugate Gradient Solver for Extended Finite Element Models

N/A
N/A
Protected

Academic year: 2021

Aktie "A Deflated Conjugate Gradient Solver for Extended Finite Element Models"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Research Collection

Other Conference Item

A Deflated Conjugate Gradient Solver for Extended Finite Element Models

Author(s):

Agathos, Konstantinos; Nicoli, Sergio; Chatzi, Eleni Publication Date:

2021-01

Permanent Link:

https://doi.org/10.3929/ethz-b-000454493

Rights / License:

In Copyright - Non-Commercial Use Permitted

This page was generated automatically upon download from the ETH Zurich Research Collection. For more information please consult the Terms of use.

ETH Library

(2)

14th World Congress on Computational Mechanics (WCCM) ECCOMAS Congress 2020 19–24 July 2020, Paris, France

A DEFLATED CONJUGATE GRADIENT SOLVER FOR EXTENDED FINITE ELEMENT MODELS

Konstantinos Agathos1,Sergio Nicoli1, and Eleni Chatzi1

1ETH Z¨urich,

Department of Civil, Environmental, and Geomatic Engineering, Stefano Franscini Platz 5, 8049 Z¨urich, Swizerland,

e-mail:{nicoli,agathos,chatzi}@ibk.baug.ethz.ch

Key Words:Conjugate Gradients, Deflation, XFEM, Crack

In finite element analysis for solid mechanics, the solution of the linear system of equations represents the performance bottleneck in terms of both computation time and memory storage. For this task, direct solvers are a common choice due to their simplicity and robustness, however the very large amount of memory required to factorize the stiffness matrix precludes the solution of medium to large-sized problems. For this reason, substantial research effort in the field of iterative solvers has resulted in the adoption of the Conjugate Gradient (CG) method. In this procedure, explicit factorization and thus large quantities of additional memory are not necessary, due to the use of a gradient-descent optimization process. Among many available improvements of the CG, the Deflated Conjugate Gradient (DCG) solver [2] includes information from approximate eigenvectors (known as the deflation space) to achieve a faster convergence.

In this contribution, we present an application of the DCG for fracture mechanics with the eXtended Finite Element Method (XFEM) [1]. Among other features, such as holes and inclusions, cracks can be effectively modeled with this method, due to the addition of degrees of freedom and functions that enable the representation of discontinuous displacements and singular stresses within the solution space.

In addition to the perspective of accelerated numerical analysis, the motivation to employ an iterative solver lies in the fact that no explicit assembly of the entire stiffness matrix is required, which has positive implications in crack propagation and large scale analyses.

With this approach, the main challenge lies in the construction of the deflation space in the presence of additional displacement patterns provided by the enrichment functions. Different methods to achieve this feature are studied and tested. With respect to the CG, the decrease in the number of necessary iterations provided by the optimal method should be comparable to the one delivered in a setup without enrichment. Finally, one can observe that, especially for large simulations, such acceleration justifies the higher implementation effort required.

References

[1] N. Mo¨es, J. Dolbow, and T. Belytschko, “A finite element method for crack growth without remesh- ing,”International journal for numerical methods in engineering, vol. 46, no. 1, pp. 131–150, 1999.

[2] Y. Saad, M. Yeung, J. Erhel, and F. Guyomarc’h, “A deflated version of the conjugate gradient algorithm,”SIAM Journal on Scientific Computing, vol. 21, no. 5, pp. 1909–1926, 2000.

Referenzen

ÄHNLICHE DOKUMENTE

The synchronous algorithm is a modification of standard sta- tionary linear iterative methods using an observation which allows the vectors involved in the computation to remain

The NuSol program makes the finite differences based Numerov, the pseudo-spectral Chebyshev method and the sinc () DVR easily accessible to anyone interested in solving the

The performance of the proposed solver is illustrated through numerical experiments, which show its competitiveness in terms of iteration count, run-time and parallel scaling..

+RZHYHU 6S GHPRQVWUDWHV DQ LQWHUPHGLDWH FRQGLWLRQ LQ WKH ORZHU DSSHQGDJH VWUXFW XUH ZLWK WKH DEGRPLQDO SDWWHUQ EHLQJ MXVW WKH VDPH DV LQ 6S DQG 6S 7KHVH LQWHU PHGLDWH IRUPV DUH

The submitted version of riss 1.0 is furthermore able to parallelize unit propagation [12] of a sequential solver.. The parallelization of riss 1.0 is quite experimental, such that

fluidic membranes, incompressible two-phase flow, parametric finite elements, Helfrich energy, spontaneous curvature, area difference elasticity (ADE), local surface area

– compiler generates message passing or shared memory parallel code – work distribution & communication is implicit.

Rumpf: A level set method for anisotropic geometric diffusion in 3D