RUS  ENG
Full version
JOURNALS // Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia // Archive

Dokl. RAN. Math. Inf. Proc. Upr., 2024 Volume 517, Pages 41–43 (Mi danma528)

This article is cited in 4 papers

MATHEMATICS

Multidimensional Fourier interpolation and fast Fourier transforms

Yu. A. Basalova, N. N. Dobrovol'skiiab, V. N. Chubarikovb

a Tula State Pedagogical University, Tula, Russia
b Lomonosov Moscow State University, Moscow, Russia

Abstract: It is proved that the coefficients of the interpolation polynomial over a parallelepipedal grid for a multidimensional function are equal to the coefficients of the interpolation polynomial over a uniform grid for a one-dimensional function. These coefficients can be obtained by applying the fast Fourier transform based on various schemes.

Keywords: parallelepipedal grid, linear congruence lattice, interpolation polynomial, fast Fourier transform.

UDC: 511

Presented: A. L. Semenov
Received: 26.04.2024
Revised: 26.04.2024
Accepted: 22.05.2024

DOI: 10.31857/S2686954324030074


 English version:
Doklady Mathematics, 2024, 109:3, 224–226

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025