Numerically efficient modified Runge–Kutta solver for fatigue crack growth analysis

Abstract

We present a modified Runge–Kutta algorithm which yields a conservative estimate of the crack size for fatigue crack growth even for large integration step sizes. Conservative in this context means to overestimate the crack size. Commonly used algorithms (e.g. Euler, Runge–Kutta) usually underestimate the crack growth and only converge for small step sizes to an accurate value. As the presented algorithm overestimates the crack growth even for large and converges for small integration step sizes, it can be used for instance in Monte-Carlo based probabilistic fracture mechanics simulations, which might be otherwise computational impractical.