Abstract
This work investigates matrix‐free algorithms for problems in quasi‐static finite‐strain hyperelasticity. Iterative solvers with matrix‐free operator evaluation have emerged as an attractive alternative to sparse matrices in the fluid dynamics and wave propagation communities because they significantly reduce the memory traffic, the limiting factor in classical finite element solvers. Specifically, we study different matrix‐free realizations of the finite element tangent operator and determine whether generalized methods of incorporating complex constitutive behavior might be feasible. In order to improve the convergence behavior of iterative solvers, we also propose a method by which to construct level tangent operators and employ them to define a geometric multigrid preconditioner. The performance of the matrix‐free operator and the geometric multigrid preconditioner is compared to the matrix‐based implementation with an algebraic multigrid (AMG) preconditioner on a single node for a representative numerical example of a heterogeneous hyperelastic material in two and three dimensions. We find that matrix‐free methods for finite‐strain solid mechanics are very promising, outperforming linear matrix‐based schemes by two to five times, and that it is possible to develop numerically efficient implementations that are independent of the hyperelastic constitutive law.
