Using surrogate models to accelerate load step methods for nonlinear finite element problems in hyperelasticity

Finite element methods for displacement problems in hyperelasticity lead to systems of nonlinear equations. These equations are usually solved with Newton's method or a related method. The convergence of Newton's method depends heavily on the proximity of the initial guess to the numerical solution. Load step methods overcome problems with divergence by applying the load in increments, leading to a sequence of sub‐problems with initial guesses closer to the numerical solution of each sub‐problem, supporting the convergence. The downside of this approach is the high computational effort needed to solve the load steps. Based on a benchmark problem in high‐order FEM, we extend traditional load step methods to a new approach exploiting the hierarchical basis used for the spatial discretization of the problem and saving up to 50% of computation time (vs. benchmark).

Publication Details

Journal
TUHH Open Research
Published
2024-10-04
DOI
https://doi.org/10.15480/882.14616
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Using surrogate models to accelerate load step methods for nonlinear finite element problems in hyperelasticity

TUHH Open Research
Advanced Numerical Methods in Computational Mathematics
article

Using surrogate models to accelerate load step methods for nonlinear finite element problems in hyperelasticity

article en

Abstract

Finite element methods for displacement problems in hyperelasticity lead to systems of nonlinear equations. These equations are usually solved with Newton's method or a related method. The convergence of Newton's method depends heavily on the proximity of the initial guess to the numerical solution. Load step methods overcome problems with divergence by applying the load in increments, leading to a sequence of sub‐problems with initial guesses closer to the numerical solution of each sub‐problem, supporting the convergence. The downside of this approach is the high computational effort needed to solve the load steps. Based on a benchmark problem in high‐order FEM, we extend traditional load step methods to a new approach exploiting the hierarchical basis used for the spatial discretization of the problem and saving up to 50% of computation time (vs. benchmark).

TUHH Open Research
Openalex Percentile: Top 69%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.