z-logo
Premium
Efficient implementation of an explicit partitioned shear and longitudinal wave propagation algorithm
Author(s) -
Kolman R.,
Cho S. S.,
Park K. C.
Publication year - 2015
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.5174
Subject(s) - wavefront , wave propagation , algorithm , shear (geology) , computer science , tracking (education) , mathematics , physics , geology , optics , petrology , psychology , pedagogy
Summary The paper complements and extends the previous works on partitioned explicit wave propagation analysis methods, which were presented for discontinuous wave propagation problems in solids. An efficient implementation of the partitioned explicit wave propagation analysis methods is introduced. The present implementation achieves about 25% overall computational effort compared with the previous implementation with the same accuracy. The present algorithm tracks, with different integration time step sizes in accordance with their different wave speeds, the propagation fronts of longitudinal and shear waves. This is accomplished by integrating separately the element‐by‐element partitioned longitud inal and shear equations of motion. The state vectors (displacements, velocity and accelerations) of the longitudinal and shear components are reconciled at the end of each time step. The reconciliation procedure does not require any system parameters such as material properties, density, unlike conventional artificial viscosity methods. Numerical examples are presented as applied to linear and non‐linear wave propagation problems, which demonstrate high‐fidelity wavefront tracking ability of the present method, and compared with existing conventional wave propagation analysis methods. Copyright © 2015 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here