Spelling suggestions: "subject:"bainite element exterior calculus"" "subject:"alinite element exterior calculus""
1 |
Stability of dual discretization methods for partial differential equationsGillette, Andrew Kruse 06 July 2011 (has links)
This thesis studies the approximation of solutions to partial differential equations (PDEs) over domains discretized by the dual of a simplicial mesh. While `primal' methods associate degrees of freedom (DoFs) of the solution with specific geometrical entities of a simplicial mesh (simplex vertices, edges, faces, etc.), a `dual discretization method' associates DoFs with the geometric duals of these objects. In a tetrahedral mesh, for instance, a primal method might assign DoFs to edges of tetrahedra while a dual method for the same problem would assign DoFs to edges connecting circumcenters of adjacent tetrahedra.
Dual discretization methods have been proposed for various specific PDE problems, especially in the context of electromagnetics, but have not been analyzed using the full toolkit of modern numerical analysis as is considered here. The recent and still-developing theories of finite element exterior calculus (FEEC) and discrete exterior calculus (DEC) are shown to be essential in understanding the feasibility of dual methods. These theories treat the solutions of continuous PDEs as differential forms which are then discretized as cochains (vectors of DoFs) over a mesh. While the language of DEC is ideal for describing dual methods in a straightforward fashion, the results of FEEC are required for proving convergence results.
Our results about dual methods are focused on two types of stability associated with PDE solvers: discretization and numerical. Discretization stability analyzes the convergence of the approximate solution from the discrete method to the continuous solution of the PDE as the maximum size of a mesh element goes to zero. Numerical stability analyzes the potential roundoff errors accrued when computing an approximate solution. We show that dual methods can attain the same approximation power with regard to discretization stability as primal methods and may, in some circumstances, offer improved numerical stability properties.
A lengthier exposition of the approach and a detailed description of our results is given in the first chapter of the thesis. / text
|
Page generated in 0.0871 seconds