Please use this identifier to cite or link to this item:
Title: A comparison between two methods of adaptive mesh refinement for finite differences : one dimensional Dirichlet problems
Authors: Issi, Rudy
Advisors: Sabat, Mira 
Keywords: Adaptive mesh refinement, finite differences, discretization, node-based, centered-based, size of the cell, average length of the gradient, error tolerance
Subjects: Applied mathematics
Dissertations, Academic
University of Balamand--Dissertations
Issue Date: 2021
In the present work, we consider two methods of adaptive mesh refinement in finite differences for one dimensional Dirichlet problems. There are two approaches in the discretization: node based and centered based schemes. For each one of these schemes, the discretization equations over a non-uniform grid and the error analysis are established. The two methods of adaptive mesh refinement have different criteria. The first method considers two main criteria: the size of the cell and the average length of the gradient of the solution. On the other hand, the second method considers the error tolerance as the refinement criterion. The two methods also differ in the meshing algorithm. In fact, method 1 simply splits a cell into two cells, whereas method 2 clusters nodes together and performs the meshing process. The two methods are compared and some numerical examples are considered. As an application, a C ++ code was written to implement the node based adaptive mesh refinement for both methods, and the plotting was done in MATLAB.
Includes bibliographical references (p. 84-85)
Rights: This object is protected by copyright, and is made available here for research and educational purposes. Permission to reuse, publish, or reproduce the object beyond the personal and educational use exceptions must be obtained from the copyright holder
Ezproxy URL: Link to full text
Type: Project
Appears in Collections:UOB Theses and Projects

Show full item record

Record view(s)

checked on Aug 15, 2022

Google ScholarTM


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