{"title":"Fast Gauss transforms with complex parameters using NFFTs","authors":"Stefan Kunis, D. Potts, G. Steidl","doi":"10.1515/156939506779874626","DOIUrl":null,"url":null,"abstract":"We construct a fast algorithm for the computation of discrete Gauss transforms with complex parameters, capable of dealing with non equispaced points. Our algorithm is based on the fast Fourier transform at non equispaced knots and requires only (N) arithmetic operations.","PeriodicalId":342521,"journal":{"name":"J. Num. Math.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Num. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/156939506779874626","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
Abstract
We construct a fast algorithm for the computation of discrete Gauss transforms with complex parameters, capable of dealing with non equispaced points. Our algorithm is based on the fast Fourier transform at non equispaced knots and requires only (N) arithmetic operations.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
