{"title":"Exponential time propagators for elastodynamics","authors":"Paavai Pari, Bikash Kanungo, Vikram Gavini","doi":"arxiv-2405.05213","DOIUrl":null,"url":null,"abstract":"We propose a computationally efficient and systematically convergent approach\nfor elastodynamics simulations. We recast the second-order dynamical equation\nof elastodynamics into an equivalent first-order system of coupled equations,\nso as to express the solution in the form of a Magnus expansion. With any\nspatial discretization, it entails computing the exponential of a matrix acting\nupon a vector. We employ an adaptive Krylov subspace approach to inexpensively\nand and accurately evaluate the action of the exponential matrix on a vector.\nIn particular, we use an apriori error estimate to predict the optimal Kyrlov\nsubspace size required for each time-step size. We show that the Magnus\nexpansion truncated after its first term provides quadratic and superquadratic\nconvergence in the time-step for nonlinear and linear elastodynamics,\nrespectively. We demonstrate the accuracy and efficiency of the proposed method\nfor one linear (linear cantilever beam) and three nonlinear (nonlinear\ncantilever beam, soft tissue elastomer, and hyperelastic rubber) benchmark\nsystems. For a desired accuracy in energy, displacement, and velocity, our\nmethod allows for $10-100\\times$ larger time-steps than conventional\ntime-marching schemes such as Newmark-$\\beta$ method. Computationally, it\ntranslates to a $\\sim$$1000\\times$ and $\\sim$$10-100\\times$ speed-up over\nconventional time-marching schemes for linear and nonlinear elastodynamics,\nrespectively.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"154 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Numerical Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.05213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We propose a computationally efficient and systematically convergent approach
for elastodynamics simulations. We recast the second-order dynamical equation
of elastodynamics into an equivalent first-order system of coupled equations,
so as to express the solution in the form of a Magnus expansion. With any
spatial discretization, it entails computing the exponential of a matrix acting
upon a vector. We employ an adaptive Krylov subspace approach to inexpensively
and and accurately evaluate the action of the exponential matrix on a vector.
In particular, we use an apriori error estimate to predict the optimal Kyrlov
subspace size required for each time-step size. We show that the Magnus
expansion truncated after its first term provides quadratic and superquadratic
convergence in the time-step for nonlinear and linear elastodynamics,
respectively. We demonstrate the accuracy and efficiency of the proposed method
for one linear (linear cantilever beam) and three nonlinear (nonlinear
cantilever beam, soft tissue elastomer, and hyperelastic rubber) benchmark
systems. For a desired accuracy in energy, displacement, and velocity, our
method allows for $10-100\times$ larger time-steps than conventional
time-marching schemes such as Newmark-$\beta$ method. Computationally, it
translates to a $\sim$$1000\times$ and $\sim$$10-100\times$ speed-up over
conventional time-marching schemes for linear and nonlinear elastodynamics,
respectively.