Paper detail

A virtual element method for the Steklov eigenvalue problem allowing small edges

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.

preprint2020arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.