Local and parallel finite element algorithms for eigenvalue problems

Jinchao Xu, Aihui Zhou

Research output: Contribution to journalArticlepeer-review

78 Scopus citations

Abstract

Some new local and parallel finite element algorithms are proposed and analyzed in this paper for eigenvalue problems. With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraic systems on fine grid by using some local and parallel procedure. A theoretical tool for analyzing these algorithms is some local error estimate that is also obtained in this paper for finite element approximations of eigenvectors on general shape-regular grids. © Springer-Verlag 2002.
Original languageEnglish (US)
Pages (from-to)185-200
Number of pages16
JournalActa Mathematicae Applicatae Sinica
Volume18
Issue number2
DOIs
StatePublished - Jan 1 2002
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-02-15

Fingerprint

Dive into the research topics of 'Local and parallel finite element algorithms for eigenvalue problems'. Together they form a unique fingerprint.

Cite this