Superconvergent Nystrom and degenerate kernel methods for eigenvalue problems

doi:10.1016/j.amc.2011.01.098

Superconvergent Nystrom and degenerate kernel methods for eigenvalue problems

2011-06-01

10

PRE

AI

DOI：10.1016/j.amc.2011.01.098

原文链接

原文求助

摘要

En 中文

The Nystrom and degenerate kernel methods, based on projections at Gauss points onto the space of (discontinuous) piecewise polynomials of degree <= r - 1, for the approximate solution of eigenvalue problems for an integral operator with a smooth kernel, exhibit order 2r. We propose new superconvergent Nystrom and degenerate kernel methods that improve this convergence order to 4r for eigenvalue approximation and to 3r for spectral subspace approximation in the case where the kernel is sufficiently smooth. Moreover for a simple eigenvalue, we show that by using an iteration technique, an eigenvector approximation of order 4r can be obtained. The methods introduced here are similar to that studied by Kulkarni in [10] and exhibit the same convergence orders, so a comparison with these methods is worked out in detail. Also, the error terms are analyzed and the obtained methods are numerically tested. Finally, these methods are extended to the case of discontinuous kernel along the diagonal and superconvergence results are also obtained. (C) 2011 Elsevier Inc. All rights reserved.

Keyword:

Eigenvalue problem

Nystrom method

Degenerate kernel method

Superconvergent Nystrom and degenerate kernel methods for eigenvalue problems

摘要

期刊

机构

引用论文