| Title: |
On an Exact Convergence of Quasi-Periodic Interpolations for the Polyharmonic–Neumann Eigenfunctions. |
| Authors: |
Poghosyan, Arnak1 (AUTHOR) arnak@instmath.sci.am, Poghosyan, Lusine1,2 (AUTHOR) barkhudaryan@ysu.am, Barkhudaryan, Rafayel1,2 (AUTHOR) |
| Source: |
Algorithms. Nov2024, Vol. 17 Issue 11, p497. 30p. |
| Subject Terms: |
*VANDERMONDE matrices, *MATRIX inversion, *PERIODIC functions, *FOURIER series, *INTERPOLATION |
| Abstract: |
Fourier expansions employing polyharmonic–Neumann eigenfunctions have demonstrated improved convergence over those using the classical trigonometric system, due to the rapid decay of their Fourier coefficients. Building on this insight, we investigate interpolations on a finite interval that are exact for polyharmonic–Neumann eigenfunctions and exhibit similar benefits. Furthermore, we enhance the convergence of these interpolations by incorporating the concept of quasi-periodicity, wherein the basis functions are periodic over a slightly extended interval. We demonstrate that those interpolations achieve significantly better convergence rates away from the endpoints of the approximation interval and offer increased accuracy over the entire interval. We establish these properties for a specific case of polyharmonic–Neumann eigenfunctions known as the modified Fourier system. For other basis functions, we provide supporting evidence through numerical experiments. While the latter methods display superior convergence rates, we demonstrate that interpolations using the modified Fourier basis offer distinct advantages. Firstly, they permit explicit representations via the inverses of certain Vandermonde matrices, whereas other interpolation methods require approximate computations of the eigenvalues and eigenfunctions involved. Secondly, these matrix inverses can be efficiently computed for numerical applications. Thirdly, the introduction of quasi-periodicity improves the convergence rates, making them comparable to those of other interpolation techniques. [ABSTRACT FROM AUTHOR] |
|
Copyright of Algorithms is the property of MDPI and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
