Node-nested multi-grid method with Delaunay coarsening - Laboratoire Jean-Alexandre Dieudonné Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1993

Node-nested multi-grid method with Delaunay coarsening

Résumé

For finite-element non-structured type meshes, the non-nested multigrid algorithms require to build a sequence of independent meshes. The paper proposes an automatic way to generate the coarse meshes given the finest one. The method first eliminates a set of points from the current mesh level and then uses the Delaunay-Voronoi algorithm to triangulate the remaining set of points. The algorithm is presented and it is shown that it owns good properties with respect to multigrid algorithms. Several examples of its application to bi-dimensional meshes are presented.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-1898.pdf (419.03 Ko) Télécharger le fichier

Dates et versions

inria-00074773 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00074773 , version 1

Citer

Hervé Guillard. Node-nested multi-grid method with Delaunay coarsening. [Research Report] RR-1898, INRIA. 1993. ⟨inria-00074773⟩
140 Consultations
202 Téléchargements

Partager

Gmail Facebook X LinkedIn More