Record ID | ia:dftsonirregularg00hens |
Source | Internet Archive |
Download MARC XML | https://archive.org/download/dftsonirregularg00hens/dftsonirregularg00hens_marc.xml |
Download MARC binary | https://www.archive.org/download/dftsonirregularg00hens/dftsonirregularg00hens_meta.mrc |
LEADER: 02397nam 2200301 a 4500
001 ocn640478895
005 20100714094616.3
008 980626s1992 cau b f000|0 eng d
035 $a
035 $a
040 $aCMontNP$cCMontNP
086 0 $aD 208.14/2:NPS-MA-92-006
100 1 $aHenson, Van Emden.
245 10 $aDFTS on irregular grids :$bthe anterpolated DFT /$cby Van Emden Henson.
260 $aMonterey, Calif. :$bNaval Postgraduate School ;$aSpringfield, Va. :$bAvailable from National Technical Information Service,$c[1992?]
300 $a14 p. ;$c28 cm.
500 $aTitle from cover.
500 $a"NPS-MA-92-006."
500 $a"Technical report for period October 1990-March 1992."
500 $aAD A255 187.
504 $aIncludes bibliographical references (p. 11-12)
520 $aIn many instances the discrete Fourier transform (DFT) is desired for a data set that occurs on an irregular grid. Commonly the data are interpolated to a regular grid, and a fast Fourier transform (FFT) is then applied. A drawback to this approach is that typically the data have unknown smoothness properties, so that the error in the interpolation is unknown. An alternative method is presented, based upon multilevel integration techniques introduced by A. Brandt. In this approach, the kernel, e(-iwt), is interpolated to the irregular grid, rather than interpolating the data to the regular grid. This may be accomplished by pre-multiplying the data by the adjoint of the interpolation matrix (a process dubbed anterpolation), producing a new regular-grid function, and then applying a standard FFT to the new function. Since the kernel is C infinity the operation may be carried out to any preselected accuracy. A simple optimization problem can be solved to select the problem parameters in an efficient way. If the requirements of accuracy are not strict, or if a small bandwidth is of interest, the method can be used in place of an FFT even when the data are regularly spaced. Discrete Fourier Transform, FFT, Anterpolation.
650 4 $aDISCRETE FOURIER TRANSFORMS.
650 4 $aFAST FOURIER TRANSFORMS.
710 2 $aNaval Postgraduate School (U.S.).$bDept. of Mathematics.
740 0 $aNPS-MA-92-006.
592 $aaq/aq cc:9116 06/26/98
926 $aNPS-LIB$bDIGIPROJ$cD 208.14/2:NPS-MA-92-006$dBOOK$eNEVER$f1