A Two-Level Method for Nonsymmetric Eigenvalue Problems  

作　　者：Karel Kolman 

机构地区：[1]Mathematical Institute, Academy of Sciences of the Czech Republic, ■itná 25, 11567 Praha 1, Czech Republic

出　　处：《Acta Mathematicae Applicatae Sinica》2005年第1期1-12,共12页应用数学学报（英文版）

摘　　要：A two-level discretization method for eigenvalue problems is studied.Compared to the standard Galerkin finite element discretization technique performed on a fine gridthis method discretizes the eigenvalue problem on a coarse grid and obtains an improved eigenvector(eigenvalue) approximation by solving only a linear problem on the fine grid (or two linear problemsfor the case of eigenvalue approximation of nonsymmetric problems). The improved solution has theasymptotic accuracy of the Galerkin discretization solution. The link between the method and theiterated Galerkin method is established. Error estimates for the general nonsymmetric case arederived.A two-level discretization method for eigenvalue problems is studied.Compared to the standard Galerkin finite element discretization technique performed on a fine gridthis method discretizes the eigenvalue problem on a coarse grid and obtains an improved eigenvector(eigenvalue) approximation by solving only a linear problem on the fine grid (or two linear problemsfor the case of eigenvalue approximation of nonsymmetric problems). The improved solution has theasymptotic accuracy of the Galerkin discretization solution. The link between the method and theiterated Galerkin method is established. Error estimates for the general nonsymmetric case arederived.

关 键 词：eigenvalue problems finite elements POSTPROCESSING two-level method two-grid method iterated Galerkin method 

分 类 号：O241[理学—计算数学]