Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/52795
Title: Derefinement algorithms of nested meshes
Authors: Plaza, A 
Ferragut, L
Montenegro, R. 
UNESCO Clasification: 120601 Construcción de algoritmos
Keywords: Finite-Element Method
Posteriori Error Analysis
Adaptive Processes
Refinement
Issue Date: 1992
Journal: Ifip Transactions A-Computer Science And Technology
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.
URI: http://hdl.handle.net/10553/52795
ISBN: 0-444-89747-X
ISSN: 0926-5473
Source: Ifip Transactions A-Computer Science And Technology [ISSN 0926-5473], v. 12, p. 409-415
Appears in Collections:Artículos
Show full item record

Page view(s)

30
checked on Jun 14, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



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