A Type of Multigrid Method for the Steklov‐Lamé Eigenvalue Problems

ABSTRACT In this article, a type of multigrid method for solving Steklov‐Lamé eigenvalue problems is proposed. The basic idea is to avoid directly solving large‐scale Steklov‐Lamé eigenvalue problems. The main process is to transform the Steklov‐Lamé eigenvalue problems into a series of Steklov‐Lamé boundary value problems in a multilevel space sequence, and then correcting the approximate solutions for these boundary value problems in a low‐dimensional augmented subspace. Since the solution of the large‐scale Steklov‐Lamé eigenvalue problem, which involves the main computational work in the classical numerical method, is omitted, the efficiency of the solution can obviously be improved. Consistently we prove that the proposed scheme can obtain optimal approximation with linear computational complexity. Some numerical examples are given to verify the theoretical results.

Authors

Institutions

Publication Details

Journal
Numerical Methods for Partial Differential Equations
Published
2025-09-01
DOI
https://doi.org/10.1002/num.70038
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Type of Multigrid Method for the Steklov‐Lamé Eigenvalue Problems

Anmin Tian, Fei Xu, Meiling Yue
Numerical Methods for Partial Differential Equations
Advanced Numerical Methods in Computational Mathematics
article

A Type of Multigrid Method for the Steklov‐Lamé Eigenvalue Problems

Anmin Tian, Fei Xu, Meiling Yue
article en

Abstract

ABSTRACT In this article, a type of multigrid method for solving Steklov‐Lamé eigenvalue problems is proposed. The basic idea is to avoid directly solving large‐scale Steklov‐Lamé eigenvalue problems. The main process is to transform the Steklov‐Lamé eigenvalue problems into a series of Steklov‐Lamé boundary value problems in a multilevel space sequence, and then correcting the approximate solutions for these boundary value problems in a low‐dimensional augmented subspace. Since the solution of the large‐scale Steklov‐Lamé eigenvalue problem, which involves the main computational work in the classical numerical method, is omitted, the efficiency of the solution can obviously be improved. Consistently we prove that the proposed scheme can obtain optimal approximation with linear computational complexity. Some numerical examples are given to verify the theoretical results.

Numerical Methods for Partial Differential EquationsVol. 41(5)
Beijing Technology and Business University (CN), Beijing University of Technology (CN)
Openalex Percentile: Top 74%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.