On the postprocessing technique for eigenvalue problems

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a new strategy of accelerating the convergence rate for the finite element solutions of the large class of linear eigenvalue problems of order 2m. The proposed algorithms have the superconvergence properties of the eigenvalues, as well as of the eigenfunctions. This improvement is obtained at a small computational cost. Solving a more simple additional problem, we get good finite element approximations on the coarse mesh. Different ways for calculating the postprocessed eigenfunctions are considered. The case where the spectral parameter appears linearly in the boundary conditions is discussed. The numerical examples, presented here, confirm the theoretical results and show the efficiency of the postprocessing method. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Andreev, A. B., & Racheva, M. R. (2003). On the postprocessing technique for eigenvalue problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2542, 363–371. https://doi.org/10.1007/3-540-36487-0_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free