Theses and Dissertations from UMD
Permanent URI for this communityhttp://hdl.handle.net/1903/2
New submissions to the thesis/dissertation collections are added automatically as they are received from the Graduate School. Currently, the Graduate School deposits all theses and dissertations from a given semester after the official graduation date. This means that there may be up to a 4 month delay in the appearance of a give thesis/dissertation in DRUM
More information is available at Theses and Dissertations at University of Maryland Libraries.
Browse
2 results
Search Results
Item ERROR ANALYSIS OF NUMERICAL METHODS FOR NONLINEAR GEOMETRIC PDEs(2019) Li, Wenbo; Nochetto, Ricardo H; Applied Mathematics and Scientific Computation; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)This dissertation presents the numerical treatment of two classes of nonlinear geometric problems: fully nonlinear elliptic PDEs and nonlinear nonlocal PDEs. For the fully nonlinear elliptic PDEs, we study three problems: Monge-Amp\`{e}re equations, computation of convex envelopes and optimal transport with quadratic cost. We develop two-scale methods for both the Monge-Amp\`{e}re equation and the convex envelope problem with Dirichlet boundary conditions, and prove rates of convergence in the $L^{\infty}$ norm for them. Our technique hinges on the discrete comparison principle, construction of barrier functions and geometric properties of the problems. We also derive error estimates for numerical schemes of the optimal transport problem with quadratic cost, which can be written as a so-called second boundary value problem for the Monge-Amp\`{e}re equation. This contains a new weighted $L^2$ error estimate for the fully discrete linear programming method based on quantitative stability estimates for optimal plans. For the nonlinear nonlocal PDEs, we focus on the computation and numerical analysis of nonlocal minimal graphs of order $s \in (0,1/2)$ in a bounded domain. This can be reinterpreted as a Dirichlet problem for a nonlocal, nonlinear, degenerate operator of order $s + 1/2$, whose numerical treatment is in its infancy. We propose a finite element discretization and prove its convergence together with error estimates for two different notions of error. Several interesting numerical experiments are also presented and discussed, which might shed some light on theoretical questions about this emerging research topic.Item Convergence of Adaptive Finite Element Methods(2005-12-05) Mekchay, Khamron; Nochetto, Ricardo H.; Mathematics; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)We develop adaptive finite element methods (AFEMs) for elliptic problems, and prove their convergence, based on ideas introduced by D\"{o}rfler \cite{Dw96}, and Morin, Nochetto, and Siebert \cite{MNS00, MNS02}. We first study an AFEM for general second order linear elliptic PDEs, thereby extending the results of Morin et al \cite{MNS00,MNS02} that are valid for the Laplace operator. The proof of convergence relies on quasi-orthogonality, which accounts for the bilinear form not being a scalar product, together with novel error and oscillation reduction estimates, which now do not decouple. We show that AFEM is a contraction for the sum of energy error plus oscillation. Numerical experiments, including oscillatory coefficients and {both coercive and non-coercive} convection-diffusion PDEs, illustrate the theory and yield optimal meshes. The role of oscillation control is now more crucial than in \cite{MNS00,MNS02} and is discussed and documented in the experiments. We next introduce an AFEM for the Laplace-Beltrami operator on $C^1$ graphs in $R^d ~(d\ge2)$. We first derive a posteriori error estimates that account for both the energy error in $H^1$ and the geometric error in $W^1_\infty$ due to approximation of the surface by a polyhedral one. We devise a marking strategy to reduce the energy and geometric errors as well as the geometric oscillation. We prove that AFEM is a contraction on a suitably scaled sum of these three quantities as soon as the geometric oscillation has been reduced beyond a threshold. The resulting AFEM converges without knowing such threshold or any constants, and starting from any coarse initial triangulation. Several numerical experiments illustrate the theory. Finally, we introduce and analyze an AFEM for the Laplace-Beltrami operator on parametric surfaces, thereby extending the results for graphs. Note that, due to the nature of parametric surfaces, the geometric oscillation is now measured in terms of the differences of tangential gradients rather than differences of normals as for graphs. Numerical experiments with closed surfaces are provided to illustrate the theory.