4.6 Article

A Virtual Element Method for the Steklov Eigenvalue Problem Allowing Small Edges

Journal

JOURNAL OF SCIENTIFIC COMPUTING
Volume 88, Issue 2, Pages -

Publisher

SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10915-021-01555-3

Keywords

Virtual element method; Steklov eigenvalue problem; Error estimates; Polygonal meshes; Small edges

Funding

  1. National Agency for Research and Development, ANID-Chile through FONDECYT Postdoctorado project [3190204]
  2. FONDECYT project [11200529]
  3. National Agency for Research and Development, ANID-Chile through FONDECYT project [1180913, 11170534]
  4. PIA Program: Concurso Apoyo a Centros Cientificos y Tecnologicos de Excelencia con Financiamiento Basal [AFB170001]

Ask authors/readers for more resources

This paper analyzes the influence of small edges in the computation of the spectrum of the Steklov eigenvalue problem using a lowest order virtual element method. The scheme is shown to provide a correct approximation of the spectrum under weaker assumptions on the polygonal meshes. Optimal error estimates for eigenfunctions and double order for eigenvalues are proven, with numerical tests supporting the theoretical results.
The aim of this paper is to analyze the influence of small edges in the computation of the spectrum of the Steklov eigenvalue problem by a lowest order virtual element method. Under weaker assumptions on the polygonal meshes, which can permit arbitrarily small edges with respect to the element diameter, we show that the scheme provides a correct approximation of the spectrum and prove optimal error estimates for the eigenfunctions and a double order for the eigenvalues. Finally, we report some numerical tests supporting the theoretical results.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available