Superconvergent two-grid methods for elliptic eigenvalue problems
type: Item
instance of: scholarly article
title: Superconvergent two-grid methods for elliptic eigenvalue problems
zbMATH Open document ID: 1365.65245
author: Hailong Guo
author: Zhimin Zhang
author: Ren Zhao
published in: Journal of Scientific Computing
publication date: 2017-03-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1405.4641
review text: The authors consider the following second-order self-adjoint elliptic eigenvalue problem \[ \begin{aligned} -\nabla(D\nabla u) + c u &= \lambda u \text{ in }u \Omega,\\ u&=0 \text{ on } \partial \Omega, \tag{1} \end{aligned} \] where \(\Omega\) in \(\mathbb{R}^2\) is a polygonal domain with Lipschitz boundary, \(D\) is a 2\(\times\)2 symmetric positive definite matrix and \(c \in L^\infty(\Omega)\). A new two-grid numerical method to solve (1) is proposed in this work. Its algorithmic implementation is computationally more efficient than some other existing computational approaches and the method posseses superconvergence property. The theoretical results are illustrated by three numerical examples.
Mathematics Subject Classification ID: 65N25
Mathematics Subject Classification ID: 65N15
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65N12
Mathematics Subject Classification ID: 35P15
Mathematics Subject Classification ID: 65N55
zbMATH DE Number: 6690797
zbMATH Keywords: two-grid method
zbMATH Keywords: gradient recovery
zbMATH Keywords: superconvergence
zbMATH Keywords: polynomial preserving method
zbMATH Keywords: adaptive method
zbMATH Keywords: second-order self-adjoint elliptic eigenvalue problem
zbMATH Keywords: numerical example
describes a project that uses: EasyMesh
describes a project that uses: iFEM
reviewed by: Vladimir L. Makarov
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2286306354
arXiv ID: 1405.4641
cites work: Postprocessing and higher order convergence of the mixed finite element approximations of biharmonic eigenvalue problems
cites work: A posteriori error estimation in finite element analysis
cites work: Asymptotic lower bounds for eigenvalues by nonconforming finite element methods
cites work: The finite element methods and its reliability
cites work: Finite Element-Galerkin Approximation of the Eigenvalues and Eigenvectors of Selfadjoint Problems
cites work: A Convergent Adaptive Algorithm for Poisson’s Equation
cites work: Reviving the Method of Particular Solutions
cites work: The Mathematical Theory of Finite Element Methods
cites work: Q3666156
cites work: Two-Grid Finite Element Discretization Schemes Based on Shifted-Inverse Power Method for Elliptic Eigenvalue Problems
cites work: A Two-Grid Discretization Scheme for Semilinear Elliptic Eigenvalue Problems
cites work: Q4162607
cites work: A Posteriori Error Estimates for the Finite Element Approximation of Eigenvalue Problems
cites work: A finite element recovery approach to eigenvalue approximations with applications to electronic structure calculations
cites work: Three-scale finite element eigenvalue discretizations
cites work: Geometrical structure of Laplacian eigenfunctions
cites work: Q4317717
cites work: Benchmark results for testing adaptive finite element eigenvalue procedures
cites work: A Convergent Adaptive Method for Elliptic Eigenvalue Problems
cites work: Adaptive finite element methods for the Laplace eigenvalue problem
cites work: Acceleration of a two-grid method for eigenvalue problems
cites work: A two-level method for nonsymmetric eigenvalue problems
cites work: The adaptive finite element method based on multi-scale discretizations for eigenvalue problems
cites work: A multi-level correction scheme for eigenvalue problems
cites work: Lower bounds of the discretization error for piecewise polynomials
cites work: Enhancing finite element approximation for eigenvalue problems by projection method
cites work: A Posteriori and a Priori Error Analysis for Finite Element Approximations of Self-Adjoint Elliptic Eigenvalue Problems
cites work: Adaptive finite element algorithms for eigenvalue problems based on local averaging type a posteriori error estimates
cites work: Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations.
cites work: The Ultraconvergence of Eigenvalues for Bi-Quadratic Finite Elements
cites work: A Posteriori Error Estimates Based on the Polynomial Preserving Recovery
cites work: The polynomial-preserving recovery for higher order finite element methods in 2D and 3D
cites work: Enhancing Eigenvalue Approximation by Gradient Recovery
cites work: Superconvergence Postprocessing for Eigenvalues
cites work: A Defect Correction Scheme for Finite Element Eigenvalues with Applications to Quantum Chemistry
cites work: Q4404383
cites work: Q4886148
cites work: Enhancing eigenvalue approximation by gradient recovery on adaptive meshes
cites work: A Multilevel Correction Type of Adaptive Finite Element Method for Eigenvalue Problems
cites work: A two-grid discretization scheme for eigenvalue problems
cites work: Eigenvalue approximation from below using non-conforming finite elements
cites work: A New Finite Element Gradient Recovery Method: Superconvergence Property
cites work: Q5435826
cites work: The superconvergent patch recovery anda posteriori error estimates. Part 1: The recovery technique
DOI: 10.1007/S10915-016-0245-2
description: scientific article