NANAJan 9, 2017

New error estimates of linear triangle finite elements for the Steklov eigenvalue problem

arXiv:1701.02113h-index: 17
AI Analysis

Provides refined theoretical guarantees for finite element methods on non-convex domains, benefiting numerical analysts working on eigenvalue problems.

This paper improves error estimates for linear triangle finite elements solving the Steklov eigenvalue problem on concave polygonal domains, achieving optimal error bounds in the boundary norm for both conforming and nonconforming Crouzeix-Raviart elements.

In this paper we make a further discussion on the finite elements approximation for the Steklov eigenvalue problem on concave polygonal domain. We make full use of the regularity estimate and the characteristic of edge average interpolation operator of nonconforming Crouzeix-Raviart element, which is different from the existing proof argument, and prove a new and optimal error estimate in $\|\cdot\|_{0,\partialΩ}$ for the eigenfunction of linear conforming finite element and the nonconforming Crouzeix-Raviart element, which is an improvement of the current results. Finally, we present some numerical experiments to support the theoretical analysis.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes