TY - JOUR
T1 - Local and parallel finite element algorithms for eigenvalue problems
AU - Xu, Jinchao
AU - Zhou, Aihui
N1 - Generated from Scopus record by KAUST IRTS on 2023-02-15
PY - 2002/1/1
Y1 - 2002/1/1
N2 - 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.
AB - 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.
UR - http://link.springer.com/10.1007/s102550200018
UR - http://www.scopus.com/inward/record.url?scp=16244369178&partnerID=8YFLogxK
U2 - 10.1007/s102550200018
DO - 10.1007/s102550200018
M3 - Article
SN - 1618-3932
VL - 18
SP - 185
EP - 200
JO - Acta Mathematicae Applicatae Sinica
JF - Acta Mathematicae Applicatae Sinica
IS - 2
ER -