^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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : ISD LLC, Bristol, CT, Etats-Unis
paperback. Etat : New. N° de réf. du vendeur 730431
Quantité disponible : 1 disponible(s)