The kernel polynomial method based on Jacobi polynomials

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Raikov, I. O., Beltukov, Y. M.
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910512417079296
author Raikov, I. O.
Beltukov, Y. M.
author_facet Raikov, I. O.
Beltukov, Y. M.
contents The kernel polynomial method based on Jacobi polynomials $P_n^{α,β}(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 $α=\pm 1/2$, $β=\pm 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.
format Preprint
id arxiv_https___arxiv_org_abs_2407_03328
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The kernel polynomial method based on Jacobi polynomials
Raikov, I. O.
Beltukov, Y. M.
Numerical Analysis
Computational Physics
The kernel polynomial method based on Jacobi polynomials $P_n^{α,β}(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 $α=\pm 1/2$, $β=\pm 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.
title The kernel polynomial method based on Jacobi polynomials
topic Numerical Analysis
Computational Physics
url https://arxiv.org/abs/2407.03328