Two solution strategies to improve the computational performance of Sequentially Linear Analysis for quasi-brittle structures

Journal Article (2019)
Author(s)

M. Pari (TU Delft - Applied Mechanics)

Wouter Swart

Martin Gijzen (TU Delft - Numerical Analysis)

M. A.N. Hendriks (TU Delft - Applied Mechanics)

J.G. Rots (TU Delft - Applied Mechanics)

Research Group
Applied Mechanics
Copyright
© 2019 M. Pari, W. Swart, M.B. van Gijzen, M.A.N. Hendriks, J.G. Rots
DOI related publication
https://doi.org/10.1002/nme.6302
More Info
expand_more
Publication Year
2019
Language
English
Copyright
© 2019 M. Pari, W. Swart, M.B. van Gijzen, M.A.N. Hendriks, J.G. Rots
Research Group
Applied Mechanics
Issue number
10
Volume number
121 (2020)
Pages (from-to)
2128-2146
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Sequentially linear analysis (SLA), an event-by-event procedure for finite element (FE) simulation of quasi-brittle materials, is based on sequentially identifying a critical integration point in the FE model, to reduce its strength and stiffness, and the corresponding critical load multiplier (λ
crit), to scale the linear analysis results. In this article, two strategies are proposed to efficiently reuse previous stiffness matrix factorisations and their corresponding solutions in subsequent linear analyses, since the global system of linear equations representing the FE model changes only locally. The first is based on a direct solution method in combination with the Woodbury matrix identity, to compute the inverse of a low-rank corrected stiffness matrix relatively cheaply. The second is a variation of the traditional incomplete LU preconditioned conjugate gradient method, wherein the preconditioner is the complete factorisation of a previous analysis step's stiffness matrix. For both the approaches, optimal points at which the factorisation is recomputed are determined such that the total analysis time is minimised. Comparison and validation against a traditional parallel direct sparse solver, with regard to a two-dimensional (2D) and three-dimensional (3D) benchmark study, illustrates the improved performance of the Woodbury-based direct solver over its counterparts, especially for large 3D problems.