Please use this identifier to cite or link to this item:
Title: Derefinement algorithms of nested meshes
Authors: Plaza De La Hoz, Ángel 
Ferragut, L.
Montenegro Armas, Rafael 
UNESCO Clasification: 120601 Construcción de algoritmos
Keywords: Nested meshes
Issue Date: 1992
Publisher: Elsevier 
Conference: 12Th World Computer Congress On Algorithms, Software, Architecture : Information Processing 92 
Abstract: In this paper a new derefinement algorithm of nested triangular meshes is presented and discussed. This algorithm is combined with a local refinement. The refinement / derefinement combination, that we call readaptive process, is very useful to solve time-dependent problems in which moving refinement areas are required. The fact of using nested meshes enables us to use the multigrid method in order to solve the equation system associated to the finite element method. Moreover, a readaptive process can be used to obtain the best piece-wise triangular support to interpolate a given two dimensional function.
Source: Algorithms, Software, Architecture- Information Processing 92-Proceedings of the IFIP 12th World Computer Congress, Madrid, vol. 1, p. 409-415. (7-11, September 1992)
Appears in Collections:Actas de congresos
Show full item record

Page view(s)

checked on Dec 2, 2023

Google ScholarTM



Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.