Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Applied Mathematics

Portland State University

2019

Finite element method

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Trefftz Finite Elements On Curvilinear Polygons, Akash Anand, Jeffrey S. Ovall, Samuel E. Reynolds, Steffen Weisser Aug 2019

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 Feb 2019

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 …