Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Trefftz Finite Elements On Curvilinear Polygons, Akash Anand, Jeffrey S. Ovall, Samuel E. Reynolds, Steffen Weisser
Trefftz Finite Elements On Curvilinear Polygons, Akash Anand, Jeffrey S. Ovall, Samuel E. Reynolds, Steffen Weisser
Mathematics and Statistics Faculty Publications and Presentations
We present a Trefftz-type finite element method on meshes consisting of curvilinear polygons. Local basis functions are computed using integral equation techniques that allow for the efficient and accurate evaluation of quantities needed in the formation of local stiffness matrices. To define our local finite element spaces in the presence of curved edges, we must also properly define what it means for a function defined on a curved edge to be "polynomial" of a given degree on that edge. We consider two natural choices, before settling on the one that yields the inclusion of complete polynomial spaces in our local …
Spectral Discretization Errors In Filtered Subspace Iteration, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall
Spectral Discretization Errors In Filtered Subspace Iteration, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall
Mathematics and Statistics Faculty Publications and Presentations
We consider filtered subspace iteration for approximating a cluster of eigenvalues (and its associated eigenspace) of a (possibly unbounded) selfadjoint operator in a Hilbert space. The algorithm is motivated by a quadrature approximation of an operator-valued contour integral of the resolvent. Resolvents on infinite dimensional spaces are discretized in computable finite-dimensional spaces before the algorithm is applied. This study focuses on how such discretizations result in errors in the eigenspace approximations computed by the algorithm. The computed eigenspace is then used to obtain approximations of the eigenvalue cluster. Bounds for the Hausdorff distance between the computed and exact eigenvalue clusters …
The Auxiliary Space Preconditioner For The De Rham Complex, Jay Gopalakrishnan, Martin Neumüller, Panayot S. Vassilevski
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 …
Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl
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.