A numerical solution of the constrained weighted energy problem |
| |
Authors: | Andrey Chesnokov Marc Van Barel |
| |
Affiliation: | Department of Computer Science, Katholieke Universiteit Leuven, Heverlee, Belgium |
| |
Abstract: | A numerical algorithm is presented to solve the constrained weighted energy problem from potential theory. As one of the possible applications of this algorithm, we study the convergence properties of the rational Lanczos iteration method for the symmetric eigenvalue problem. The constrained weighted energy problem characterizes the region containing those eigenvalues that are well approximated by the Ritz values. The region depends on the distribution of the eigenvalues, on the distribution of the poles, and on the ratio between the size of the matrix and the number of iterations. Our algorithm gives the possibility of finding the boundary of this region in an effective way.We give numerical examples for different distributions of poles and eigenvalues and compare the results of our algorithm with the convergence behavior of the explicitly performed rational Lanczos algorithm. |
| |
Keywords: | Potential theory Constrained weighted energy problem Krylov subspace iterations Ritz values Eigenvalue distribution Rational Lanczos algorithm |
本文献已被 ScienceDirect 等数据库收录! |