Naslov
A mixed MLPG formulation for plate analysis using a quadtree-based discretization

Autori
Jarak, Tomislav ; Sorić, Jurica

Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni

Izvornik
Book of Abstracts of the 5th ICCES International Symposium on Meshless and Other Novel Computational Methods / Atluri, S.N. ; Šarler, B. - Nova Gorica : University of Nova Gorica Press, 2009, 6-6

ISBN
978-961-6311-58-8

Skup
5th ICCES International Symposium on Meshless and Other Novel Computational Methods

Mjesto i datum
Ljubljana, Slovenija, 31.08.2009. - 02.09.2009

Vrsta sudjelovanja
Plenarno

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
MLPG; mixed approach; quadtree; nonuniform discretization

Sažetak
The Meshless Local Petrov-Galerkin (MLPG) Method does not require any kind of element mesh or background cells for either interpolation or integration. However, certain issues, such as the generation of a proper set of nodes, determination of optimal parameters for numerical analysis and high computational costs, are still a matter of debate, especially in case of non-uniform discretizations. In this contribution the mixed MLPG formulatio is applied for the analysis of plate structures. All independent variables are approximated by using polynomials in the transversal direction, while the Moving Least Square (MLS) functions are employed in the in-plane directions. Non-uniform discretization is based on the hierarchical recursive quadtree subdivision of the global domain. This procedure is guided by the configuration of the global boundary and the user-specified criteria. One couple of nodes positioned on the upper and lower plate surface is inserted into each quadtree leaf cell. The governing equations are derived from the local weak form (LWF) of the 3-D equilibrium equations, written over the local sub-domains surrounding the nodes. The sizes of the local sub-domains and the MLS support domains are determined depending on the local topology of the space subdivision around the node couples. Here the cylindrical and hexagonal local sub-domains are considered. By using the face neighbor pointers, node searching is performed locally, improving the numerical efficiency of the algorithms. Performance of the proposed discretization approach will be demonstrated by numerical examples.

Izvorni jezik
Engleski

Znanstvena područja
Strojarstvo

POVEZANOST RADA