Practical Fourier Analysis — Error Bounds and Complexity

DOI10.1002/ZAMM.19910710102MaRDI QIDQ4018938zbMATH OpenOpenAlexFDO

Authors Helmut Brass

Publication date 16 January 1993

Published in ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/zamm.19910710102

zbMATH Keywords

complexityerror boundsFourier coefficients

Mathematics Subject Classification ID

Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• The calculation of trigonometric Fourier coefficients
• Error bounds of a quadrature formula with multiple nodes for the Fourier-Chebyshev coefficients for analytic functions
• On an optimal quadrature formula for approximation of Fourier integrals in the space \(W_2^{(1,0)}\)
• scientific article; zbMATH DE number 4013233
• scientific article; zbMATH DE number 55678

Cited in

(4)

• Accuracy-optimal evaluation of the Fourier transform for \(C_{L,N,\varepsilon}\) functions
• scientific article; zbMATH DE number 4104354 (Why is no real title available?)
• scientific article; zbMATH DE number 1166331 (Why is no real title available?)
• On the quality of algorithms based on spline interpolation

This page was built for publication: Practical Fourier Analysis — Error Bounds and Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018938)