
doi: 10.1002/nme.7638
ABSTRACTHeterogeneous solids often exhibit complex dynamic behavior, requiring simulations to use varying time steps. However, the conventional use of a single‐time step for the entire domain can be inefficient. This article proposes a multi‐time stepping algorithm that addresses this challenge by relaxing the constraint for an integer or constant time step ratio between subdomains and eliminating the need for kinematic interpolation. The algorithm ensures the satisfaction of the Courant‐Friedrichs‐Lewy condition, deviating only to allow subdomains to remain in synchronization. Consequently, less integration steps are performed in comparison to state‐of‐the‐art asynchronous integrators. We extend to the coupling of multiple subdomains, where each subdomain has its time step. Simulating stress wave propagation in metamaterials demonstrates that the proposed algorithm significantly accelerates simulation time, without sacrificing accuracy.
subcycling, metamaterials, stress wave propagation, Mechanics of deformable solids, asynchronous time integrators, Numerical analysis, multi-step
subcycling, metamaterials, stress wave propagation, Mechanics of deformable solids, asynchronous time integrators, Numerical analysis, multi-step
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
