Jump to ContentJump to Main Navigation

Online

99,00 € / $149.00*

* Prices subject to change. Shipping costs will be added if applicable.
Publication Date:
December 2006
ISSN:
1569-3953
DOI:
10.1515/156939506779874626

See all formats and pricing

Online
Individual Subscription Online only
Euro [D] 99.00
RRP for USA, Canada, Mexico
US$ 149.00 *
Print
Individual Subscription Online only
Euro [D] 797.00
RRP for USA, Canada, Mexico
US$ 1196.00 *
Print + Online
Individual Subscription Online only
Euro [D] 957.00
RRP for USA, Canada, Mexico
US$ 1436.00 *
*Prices subject to change. Shipping costs will be added if applicable.

Editor-in-Chief: Hoppe, Ronald H. W. / Kuznetsov, Yuri

Editorial Board Member: Carstensen, Carsten / Chen, Zhangxin / Dryja, M. / Feistauer, Miloslav / Glowinski, R. / Hackbusch, Wolfgang H.C. / Langer, Ulrich / Lazarov, Raytcho / Neittaanmaki, P. / Pironneau, O. / Quarteroni, Alfio / Rannacher, Rolf / Shi, Zhong-ci / Tyrtyshnikov, Eugene E. / Widlund, O. / Zou, Jun / Axelsson, Owe / Bjorstad, Petter E. / Kawarada, Hideo

4 Issues per year

IMPACT FACTOR 2011: 0.533
Mathematical Citation Quotient 2011: 0.27

 

VolumeIssuePage

Issues

Fast Gauss transforms with complex parameters using NFFTs

S. Kunis / D. Potts / G. Steidl

kunis@math.uni-luebeck.de, University of Lübeck, Institute of Mathematics, D–23560 Lübeck

potts@mathematik.tu-chemnitz.de, Chemnitz Universitiy of Technology, Department of Mathematics, 09107 Chemnitz, Germany

steidl@math.uni-mannheim.de, University of Mannheim, Institute of Mathematics, D–68131 Mannheim

Citation Information: Journal of Numerical Mathematics jnma. Volume 14, Issue 4, Pages 295–303, ISSN (Online) 1569-3953, ISSN (Print) 1570-2820, DOI: 10.1515/156939506779874626, December 2006

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.

Key Words: Gauss transform,; unequally spaced Fourier transforms,; fast algorithms,; chirped Gaussian,; NFFT

Comments (0)

Please log in or register to comment.