.png){kind=icon}
.png){kind=icon}
Return
Efficient high-order accurate explicit time-marching procedures for dynamic analyses
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-020-01184-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper,eta-order accurate truly-explicit time-marching procedures are proposed for dynamic analyses. In these new techniques, just eta-1 stiffness matrix-vector operations are required for solution, per time-step, providing more efficient approaches than standard high-order time-marching procedures, which demand eta matrix-vector operations per time-step. In addition, as illustrated along this work, the novel formulations are also more accurate than equivalent standard techniques, providing very effective time-domain solution procedures. Three truly-explicit time-marching procedures are discussed here, describing second-, third- and fourth-order accurate methodologies.
Keywords:
Explicit analysis
High-order techniques
Accuracy
Efficiency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.9
Papers:
2.6K
Citations:
9.3K