Numerical Analysis and Computation Commons^™

A Weak Fractional Calculus Theory And Numerical Methods For Fractional Differential Equations, Mitchell D. Sutton

Doctoral Dissertations

This dissertation is comprised of four integral parts. The first part comprises a self-contained new theory of weak fractional differential calculus in one-dimension. The crux of this new theory is the introduction of a weak fractional derivative notion which is a natural generalization of integer order weak derivatives; it also helps to unify multiple existing fractional derivative definitions.

The second part of this work presents three new families of fractional Sobolev spaces and their accompanying theory in one-dimension. The new construction and theory are based on a newly developed notion of weak fractional derivatives, which are natural generalizations of the …

The Auxiliary Space Preconditioner For The De Rham Complex, Jay Gopalakrishnan, Martin Neumüller, Panayot S. Vassilevski

Portland Institute for Computational Science Publications

We generalize the construction and analysis of auxiliary space preconditioners to the n-dimensional finite element subcomplex of the de Rham complex. These preconditioners are based on a generalization of a decomposition of Sobolev space functions into a regular part and a potential. A discrete version is easily established using the tools of finite element exterior calculus. We then discuss the four-dimensional de Rham complex in detail. By identifying forms in four dimensions (4D) with simple proxies, form operations are written out in terms of familiar algebraic operations on matrices, vectors, and scalars. This provides the basis for our implementation of …

Comparison Of Mesh And Meshless Methods For Partial Differential Equations Of Galerkin Form, Wallace F. Atterberry

UNLV Theses, Dissertations, Professional Papers, and Capstones

There are two purposes of this research project. The first purpose is to compare two types of Galerkin methods: The finite element mesh method and moving least sqaures meshless Galerkin (EFG) method. The second purpose of this project is to determine if a hybrid between the mesh and meshless method is beneficial.

This manuscript will be divided into three main parts. The first part is chapter one which develops the finite element method. The second part (Chapter two) will be developing the meshless method. The last part will provide a method for combining the mesh and meshless methods for a …

Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

Consider the tangential trace of a vector polynomial on the surface of a tetrahedron. We construct an extension operator that extends such a trace function into a polynomial on the tetrahedron. This operator can be continuously extended to the trace space of H(curl ). Furthermore, it satisfies a commutativity property with an extension operator we constructed in Part I of this series. Such extensions are a fundamental ingredient of high order finite element analysis.

Can We Have Superconvergent Gradient Recovery Under Adaptive Meshes?, Haijun Wu, Zhimin Zhang

Mathematics Research Reports

We study adaptive finite element methods for elliptic problems with domain corner singularities. Our model problem is the two dimensional Poisson equation. Results of this paper are two folds. First, we prove that there exists an adaptive mesh (gauged by a discrete mesh density function) under which the recovered.gradient by the Polynomial Preserving Recovery (PPR) is superconvergent. Secondly, we demonstrate by numerical examples that an adaptive procedure with a posteriori error estimator based on PPR does produce adaptive meshes satisfy our mesh density assumption, and the recovered gradient by PPR is indeed supercoveregent in the adaptive process.

Natural Superconvergent Points Of Triangular Finite Elements, Zhimin Zhang, Runchang Lin

Mathematics Research Reports

In this work, we analytically identify natural superconvergent points of function values and gradients for triangular elements. Both the Poisson equation and the Laplace equation are discussed for polynomial finite element spaces (with degrees up to 8) under four different mesh patterns. Our results verify computer findings of [2], especially, we confirm that the computed data have 9 digits of accuracy with an exception of one pair (which has 8-7 digits of accuracy). In addition, we demonstrate that the function value superconvergent points predicted by the symmetry theory [14] are the only superconvergent points for the Poisson equation. Finally, we …

A Posteriori Error Estimates Based On Polynomial Preserving Recovery, Zhimin Zhang, Ahmed Naga

Mathematics Research Reports

Superconvergence of order O(h^1+rho), for some rho is greater than 0, is established for gradients recovered using Polynomial Preserving Recovery technique when the mesh is mildly structured. Consequently this technique can be used in building a posteriori error estimator that is asymptotically exact.

Gradient Recovery And A Posteriori Estimate For Bilinear Element On Irregular Quadrilateral Meshes, Zhimin Zhang

Mathematics Research Reports

A polynomial preserving gradient recovery method is proposed and analyzed for bilinear element under general quadrilateral meshes. It has been proven that the recovered gradient converges at a rate O(h^{1+rho) for rho = min(alpha, 1) when the mesh is distorted O(h1+alpha) (alpha > 0) from a regular one. Consequently, the a posteriori error estimator based on the recovered gradient is asymptotically exact.}

A Meshless Gradient Recovery Method Part I: Superconvergence Property, Zhiming Zhang, Ahmed Naga

Mathematics Research Reports

A new gradient recovery method is introduced and analyzed. It is proved that the method is superconvergent for translation invariant finite element spaces of any order. The method maintains the simplicity, efficiency, and superconvergence properties of the Zienkiewicz-Zhu patch recovery method. In addition, under uniform triangular meshes, the method is superconvergent for the Chevron pattern, and ultraconvergence at element edge centers for the regular pattern.

Ultraconvergence Of Zz Patch Recovery At Mesh Symmetry Points, Zhimin Zhang, Runchang Lin

Mathematics Research Reports

Ultraconvergence property of the Zienkiewicz-Zhu gradient patch recovery technique based on local discrete least squares fitting is established for a large class of even-order finite elements. The result is valid at all rectangular mesh symmetry points. Different smoothing strategies are discussed. Superconvergence recovery for the Q8 element is proved and ultraconvergence numerical examples are demonstrated.