Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이준엽 | * |
dc.date.accessioned | 2016-08-28T11:08:52Z | - |
dc.date.available | 2016-08-28T11:08:52Z | - |
dc.date.issued | 2005 | * |
dc.identifier.issn | 0021-9991 | * |
dc.identifier.other | OAK-2726 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/219566 | - |
dc.description.abstract | The nonequispaced or nonuniform fast Fourier transform (NUFFT) arises in a variety of application areas, including imaging processing and the numerical solution of partial differential equations. In its most general form, it takes as input an irregular sampling of a function and seeks to compute its Fourier transform at a nonuniform sampling of frequency locations. This is sometimes referred to as the NUFFT of type 3. Like the fast Fourier transform, the amount of work required is of the order O(N log N), where N denotes the number of sampling points in both the physical and spectral domains. In this short note, we present the essential ideas underlying the algorithm in simple terms. We also illustrate its utility with application to problems in magnetic resonance imagin and heat flow. © 2005 Elsevier Inc. All rights reserved. | * |
dc.language | English | * |
dc.title | The type 3 nonuniform FFT and its applications | * |
dc.type | Article | * |
dc.relation.issue | 1 | * |
dc.relation.volume | 206 | * |
dc.relation.index | SCI | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 1 | * |
dc.relation.lastpage | 5 | * |
dc.relation.journaltitle | Journal of Computational Physics | * |
dc.identifier.doi | 10.1016/j.jcp.2004.12.004 | * |
dc.identifier.wosid | WOS:000229101600001 | * |
dc.identifier.scopusid | 2-s2.0-70349116714 | * |
dc.author.google | Lee J.-Y. | * |
dc.author.google | Greengard L. | * |
dc.contributor.scopusid | 이준엽(57217845916) | * |
dc.date.modifydate | 20231116123204 | * |