pith. sign in

arxiv: 1210.1846 · v2 · pith:UXONIAK4new · submitted 2012-10-06 · 🧮 math.NA · cs.NA

Convergence Rate and Quasi-Optimal Complexity of Adaptive Finite Element Computations for Multiple Eigenvalues

classification 🧮 math.NA cs.NA
keywords adaptiveeigenvalueelementfinitemultipleapproximationcomplexityconvergence
0
0 comments X
read the original abstract

In this paper, we study an adaptive finite element method for multiple eigenvalue problems of a class of second order elliptic equations. By using some eigenspace approximation technology and its crucial property which is also presented in this paper, we extend the results in \cite{dai-xu-zhou08} to multiple eigenvalue problems, we obtain both convergence rate and quasi-optimal complexity of the adaptive finite element eigenvalue approximation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.