Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Error estimation for simplifications of electrostatic models

Rahimi, Amir 2016. Error estimation for simplifications of electrostatic models. PhD Thesis, Cardiff University.
Item availability restricted.

[thumbnail of 2016rahimiaphd.pdf]
PDF - Accepted Post-Print Version
Download (1MB) | Preview
[thumbnail of rahimia.pdf] PDF - Supplemental Material
Restricted to Repository staff only

Download (2MB)


Based on a posteriori error estimation a method to bound the error induced by simplifying the geometry of a model is presented. Error here refers to the solution of a partial differential equation and a specific quantity of interest derived from it. Geometry simplification specifically refers to replacing CAD model features with simpler shapes. The simplification error estimate helps to determine whether a feature can be removed from the model by indicating how much the simplification affects the physical properties of the model as measured by a quantity of interest. The approach in general can also be extended to other problems governed by linear elliptic equations. Strict bounds for the error are proven for errors expressed in the energy norm. The approach relies on the Constitutive Relation Error to enable practically useful and computationally affordable bounds for error measures in the energy error norm. All methodologies are demonstrated for a second order elliptic partial differential equation for electrostatic problems. Finite element simplification error estimation code is developed to calculate the simplification error numerically. Numerical experiments for some geometric models of capacitors show satisfactory results for the simplification error bounds for a range of different deafeaturing cases and a quantity of interest, linear in the solution of the electrostatic partial differential equation. Overall the numerically calculated bounds are always valid, but are more or less accurate depending on the type of feature and its simplification. In particular larger errors may be overestimated, while good estimates for small errors can be achieved. This makes the bound overall suitable to decide whether simplifying a feature is acceptable or not.

Item Type: Thesis (PhD)
Status: Unpublished
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Funders: Marie Curie JTN
Date of First Compliant Deposit: 31 March 2017
Last Modified: 05 Jan 2022 03:34

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics