Yu. A. Basalov, N. N. Dobrovolsky, V. N. Chubarikov
{"title":"多维傅里叶插值和快速傅里叶变换","authors":"Yu. A. Basalov, N. N. Dobrovolsky, V. N. Chubarikov","doi":"10.1134/S1064562424702065","DOIUrl":null,"url":null,"abstract":"<p>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.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multidimensional Fourier Interpolation and Fast Fourier Transforms\",\"authors\":\"Yu. A. Basalov, N. N. Dobrovolsky, V. N. Chubarikov\",\"doi\":\"10.1134/S1064562424702065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>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.</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1064562424702065\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562424702065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multidimensional Fourier Interpolation and Fast Fourier Transforms
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.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
