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.
|Original language||English (US)|
|Number of pages||16|
|Journal||Acta Mathematicae Applicatae Sinica|
|State||Published - 2002|
All Science Journal Classification (ASJC) codes
- Applied Mathematics