IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i10p1722-d818269.html
   My bibliography  Save this article

“Mixed” Meshless Time-Domain Adaptive Algorithm for Solving Elasto-Dynamics Equations

Author

Listed:
  • Maoxiong Liao

    (School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China)

  • Tao Zhang

    (School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China)

  • Jinggu Cao

    (School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China)

Abstract

A time-domain adaptive algorithm was developed for solving elasto-dynamics problems through a mixed meshless local Petrov-Galerkin finite volume method (MLPG5). In this time-adaptive algorithm, each time-dependent variable is interpolated by a time series function of n-order, which is determined by a criterion in each step. The high-order series of expanded variables bring high accuracy in the time domain, especially for the elasto-dynamic equations, which are second-order PDE in the time domain. In the present mixed MLPG5 dynamic formulation, the strains are interpolated independently, as are displacements in the local weak form, which eliminates the expensive differential of the shape function. In the traditional MLPG5, both shape function and its derivative for each node need to be calculated. By taking the Heaviside function as the test function, the local domain integration of stiffness matrix is avoided. Several numerical examples, including the comparison of our method, the MLPG5–Newmark method and FEM (ANSYS) are given to demonstrate the advantages of the presented method: (1) a large time step can be used in solving a elasto-dynamics problem; (2) computational efficiency and accuracy are improved in both space and time; (3) smaller support sizes can be used in the mixed MLPG5.

Suggested Citation

  • Maoxiong Liao & Tao Zhang & Jinggu Cao, 2022. "“Mixed” Meshless Time-Domain Adaptive Algorithm for Solving Elasto-Dynamics Equations," Mathematics, MDPI, vol. 10(10), pages 1-24, May.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:10:p:1722-:d:818269
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/10/1722/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/10/1722/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:10:p:1722-:d:818269. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.