Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers

被引:3
|
作者
Martikainen, J [1 ]
Rossi, T [1 ]
Toivanen, J [1 ]
机构
[1] Univ Jyvaskyla, Dept Math Informat Technol, FIN-40351 Jyvaskyla, Finland
来源
关键词
algebraic eigenvalue problem; Lanczos algorithm; fast elliptic solver;
D O I
10.1002/cnm.422
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The computation of a few smallest eigenvalues of generalized algebraic eigenvalue problems is studied. The considered problems are obtained by discretizing self-adjoint second-order elliptic partial differential eigenvalue problems in two- or three-dimensional domains. The standard Lanczos algorithm with the complete orthogonalization is used to compute some eigenvalues of the inverted eigenvalue problem. Under suitable assumptions, the number of Lanczos iterations is shown to be independent of the problem size. The arising linear problems are solved using some standard fast elliptic solver. Numerical experiments demonstrate that the inverted problem is much easier to solve with the Lanczos algorithm that the original problem. In these experiments, the underlying Poisson and elasticity problems are solved using a standard multigrid method. Copyright (C) 2001 John Wiley & Sons, Ltd.
引用
收藏
页码:521 / 527
页数:7
相关论文
共 50 条