REVIEW
Local and Parallel Finite Element Algorithm Based On Multilevel Discretization for Eigenvalue Problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Local and Parallel Finite Element Algorithm Based On Multilevel Discretization for Eigenvalue Problem
read the original abstract
A local and parallel algorithm based on the multilevel discretization is proposed in this paper to solve the eigenvalue problem by the finite element method. With this new scheme, solving the eigenvalue problem in the finest grid is transferred to solutions of the eigenvalue problems on the coarsest mesh and a series of solutions of boundary value problems by using the local and parallel algorithm. The computational work in each processor can reach the optimal order. Therefore, this type of multilevel local and parallel method improves the overall efficiency of solving the eigenvalue problem. Some numerical experiments are presented to validate the efficiency of the new method.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.