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 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.
