Hostname: page-component-76d6cb85b7-f97m6 Total loading time: 0 Render date: 2026-07-23T04:17:39.879Z Has data issue: false hasContentIssue false

The node distribution for meshless methods*

Published online by Cambridge University Press:  15 August 2001

C. Hérault
Affiliation:
Laboratoire d'Électotechnique de Grenoble, ENSIEG (INPG-UJF, CNRS UMR 5529), BP 46, 38402 Saint-Martin-d'Hères Cedex, France
V. Leconte
Affiliation:
Laboratoire d'Électotechnique de Grenoble, ENSIEG (INPG-UJF, CNRS UMR 5529), BP 46, 38402 Saint-Martin-d'Hères Cedex, France
Y. Maréchal*
Affiliation:
Laboratoire d'Électotechnique de Grenoble, ENSIEG (INPG-UJF, CNRS UMR 5529), BP 46, 38402 Saint-Martin-d'Hères Cedex, France
G. Meunier
Affiliation:
Laboratoire d'Électotechnique de Grenoble, ENSIEG (INPG-UJF, CNRS UMR 5529), BP 46, 38402 Saint-Martin-d'Hères Cedex, France
Get access

Abstract

Meshless methods are new numerical simulation methods. Meshless methods are based on a simple set of nodes that has to be optimizedto obtain a good convergence of the approximation.For these reasons, in this paper, we have developed a new procedure in orderto generate the initial set of nodes. This approach does not rely on any existing meshing technique, such as Delaunay or advancing front. It is based on a map density of nodes and a regularization procedure.

Keywords

Information

Type
Research Article
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable