The kernel polynomial method based on Jacobi polynomials
Abstract
The kernel polynomial method based on Jacobi polynomials Pnα,β(x) is proposed. The optimal-resolution positivity-preserving kernels and the corresponding damping factors are obtained. The results provide a generalization of the Jackson damping factors for arbitrary Jacobi polynomials. For α = 1/2, β = 1/2 (Chebyshev polynomials of the first to fourth kinds), explicit trigonometric expressions for the damping factors are obtained. The resulting algorithm can be easily introduced into existing implementations of the kernel polynomial method.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.