Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Node-nested multi-grid method with Delaunay coarsening

Hervé Guillard 1 
1 SINUS - Numerical Simulation for the Engineering Sciences
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : 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.
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:16:47 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:39 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:22:42 PM


  • HAL Id : inria-00074773, version 1



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



Record views


Files downloads