AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (420.5 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

A multigrid discretization scheme of discontinuous Galerkin method for the Steklov-Lamé eigenproblem

Liangkun XuHai Bi( )
School of Mathematical Sciences, Guizhou Normal University, Universities Town, Huaxi District, Guiyang, Guizhou, China
Show Author Information

Abstract

In this paper, for the Steklov-Lamé eigenvalue problem, we propose a multigrid discretization scheme of discontinuous Galerkin method based on the shifted-inverse iteration. Based on the existing a priori error estimates, we give the error estimates for the proposed scheme and prove that the resulting approximations can achieve the optimal convergence order when the mesh sizes fit into some relationships. Finally, we combine the multigrid scheme and adaptive procedure to present some numerical examples which indicate that our scheme are locking-free and efficient for computing Steklov-Lamé eigenvalues.

CLC number: 65N25, 65N30

References

【1】
【1】
 
 
AIMS Mathematics
Pages 14207-14231

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Xu L, Bi H. A multigrid discretization scheme of discontinuous Galerkin method for the Steklov-Lamé eigenproblem. AIMS Mathematics, 2023, 8(6): 14207-14231. https://doi.org/10.3934/math.2023727

120

Views

1

Downloads

2

Crossref

2

Web of Science

2

Scopus

Received: 06 January 2023
Revised: 01 April 2023
Accepted: 03 April 2023
Published: 15 June 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)