View : 568 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author이준엽*
dc.date.accessioned2016-08-28T11:08:52Z-
dc.date.available2016-08-28T11:08:52Z-
dc.date.issued2005*
dc.identifier.issn0021-9991*
dc.identifier.otherOAK-2726*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/219566-
dc.description.abstractThe 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.languageEnglish*
dc.titleThe type 3 nonuniform FFT and its applications*
dc.typeArticle*
dc.relation.issue1*
dc.relation.volume206*
dc.relation.indexSCI*
dc.relation.indexSCIE*
dc.relation.indexSCOPUS*
dc.relation.startpage1*
dc.relation.lastpage5*
dc.relation.journaltitleJournal of Computational Physics*
dc.identifier.doi10.1016/j.jcp.2004.12.004*
dc.identifier.wosidWOS:000229101600001*
dc.identifier.scopusid2-s2.0-70349116714*
dc.author.googleLee J.-Y.*
dc.author.googleGreengard L.*
dc.contributor.scopusid이준엽(57217845916)*
dc.date.modifydate20231116123204*
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE