In the present paper, we propose a numerical method for the simultaneous approximation of the finite Hilbert and Hadamard transforms of a given function f, supposing to know only the samples of f at equidistant points. As reference interval we consider [-1,1] and as approximation tool we use iterated Boolean sums of Bernstein polynomials, also known as generalized Bernstein polynomials. Pointwise estimates of the errors are proved, and some numerical tests are given to show the performance of the procedures and the theoretical results.
Approximation of Finite Hilbert and Hadamard Transforms by Using Equally Spaced Nodes
Themistoclakis Woula
2020
Abstract
In the present paper, we propose a numerical method for the simultaneous approximation of the finite Hilbert and Hadamard transforms of a given function f, supposing to know only the samples of f at equidistant points. As reference interval we consider [-1,1] and as approximation tool we use iterated Boolean sums of Bernstein polynomials, also known as generalized Bernstein polynomials. Pointwise estimates of the errors are proved, and some numerical tests are given to show the performance of the procedures and the theoretical results.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.