• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Fast and Approximate Computation of Laplace and Fourier Transforms

Fast and Approximate Computation of Laplace and Fourier Transforms

Paperback

General Mathematics

Currently unavailable to order

ISBN10: 3832542264
ISBN13: 9783832542269
Publisher: Logos Verlag Berlin
Published: Mar 20 2016
Pages: 125
Weight: 0.35
Height: 0.33 Width: 5.68 Depth: 8.04
Language: English
TFast and Approximate Computation of Laplace and Fourier Transforms Aby Ines Melzer DIn this thesis, we treat the computation of transforms with asymptotically smooth and oscillatory kernels. We introduce the discrete Laplace transform in a modern form including a generalization to more general kernel functions. These more general kernels lead to specific function transforms. Moreover, we treat the butterfly fast Fourier transform. Based on a local error analysis, we develop a rigorous error analysis for the whole butterfly scheme. In the final part of the thesis, the Laplace and Fourier transform are combined to a fast Fourier transform for nonequispaced complex evaluation nodes. All theoretical results on accuracy and computational complexity are illustrated by numerical experiments.

Also in

General Mathematics