RUS  ENG
Full version
JOURNALS // Chebyshevskii Sbornik // Archive

Chebyshevskii Sb., 2024 Volume 25, Issue 4, Pages 42–52 (Mi cheb1473)

Multidimensional Fourier interpolation and complexity of the fast Fourier transform

Yu. A. Basalova, V. A. Bykovskiia, N. N. Dobrovol'skiia, V. N. Chubarikovb, N. M. Dobrovol'skiia

a Tula State Lev Tolstoy Pedagogical University (Tula)
b Lomonosov Moscow State University (Moscow)

Abstract: The equality of the coefficients of the interpolation polynomial over a parallelepipedal grid for a multidimensional function to the coefficients of the interpolation polynomial over a uniform grid for a one-dimensional function is proved, for which the fast Fourier transform can be applied according to various schemes.

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

UDC: 511.3

Received: 15.05.2024
Accepted: 24.12.2024

DOI: 10.22405/2226-8383-2024-25-4-42-52



© Steklov Math. Inst. of RAS, 2025