Semi-implicit methods for the dynamics of elastic sheets
•We present efficient semi-implicit algorithms for the dynamics of elastic sheets.•The triangular lattice algorithm was found to be unconditionally stable.•The finite-difference algorithm is stable for large time steps.•We find transitions from periodic to chaotic dynamics as key parameters are vari...
Gespeichert in:
Veröffentlicht in: | Journal of computational physics 2019-12, Vol.399, p.108952, Article 108952 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •We present efficient semi-implicit algorithms for the dynamics of elastic sheets.•The triangular lattice algorithm was found to be unconditionally stable.•The finite-difference algorithm is stable for large time steps.•We find transitions from periodic to chaotic dynamics as key parameters are varied.
Recent applications (e.g. active gels and self-assembly of elastic sheets) motivate the need to efficiently simulate the dynamics of thin elastic sheets. We present semi-implicit time stepping algorithms to improve the time step constraints that arise in explicit methods while avoiding much of the complexity of fully-implicit approaches. For a triangular lattice discretization with stretching and bending springs, our semi-implicit approach involves discrete Laplacian and biharmonic operators, and is stable for all time steps in the case of overdamped dynamics. For a more general finite-difference formulation that can allow for general elastic constants, we use the analogous approach on a square grid, and find that the largest stable time step is two to three orders of magnitude greater than for an explicit scheme. For a model problem with a radial traveling wave form of the reference metric, we find transitions from quasi-periodic to chaotic dynamics as the sheet thickness is reduced, wave amplitude is increased, and damping constant is reduced. |
---|---|
ISSN: | 0021-9991 1090-2716 |
DOI: | 10.1016/j.jcp.2019.108952 |