A Computationally Efficient Meshless Local Petrov-Galerkin Method for Axisymmetric Problems | Zendy

I. S. Raju | Zendy; Tzi-Kang Chen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Computationally Efficient Meshless Local Petrov-Galerkin Method for Axisymmetric Problems

Author(s) -

I. S. Raju,

Tzi-Kang Chen

Publication year - 2003

Publication title -

54th aiaa/asme/asce/ahs/asc structures, structural dynamics, and materials conference

Language(s) - English

Resource type - Conference proceedings

DOI - 10.2514/6.2003-1673

Subject(s) - petrov–galerkin method , rotational symmetry , regularized meshless method , computer science , galerkin method , mathematics , mathematical optimization , physics , finite element method , singular boundary method , geometry , boundary element method , thermodynamics

The Meshless Local Petrov-Galerkin (MLPG) method is one of the recently developed element-free methods. The method is convenient and can produce accurate results with continuous secondary variables, but is more computationally expensive than the finite element method. To overcome this disadvantage, a simple Heaviside test function is chosen. The computational effort is significantly reduced by eliminating the domain integral for the axisymmetric potential problems and by simplifying the domain integral for the axisymmetric elasticity problems. The method is evaluated through several patch tests for axisymmetric problems and example problems for which the exact solutions are available. The present method yielded very accurate solutions. The sensitivity of several parameters of the method is also studied.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research