| Summary: | In the present paper, we propose a numerical method for the simultaneous approximation of the finite Hilbert and Hadamard transforms of a given function <i>f</i>, supposing to know only the samples of <i>f</i> at equidistant points. As reference interval we consider <inline-formula> <math display="inline"> <semantics> <mrow> <mo>[</mo> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mn>1</mn> <mo>]</mo> </mrow> </semantics> </math> </inline-formula> 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.
|
|---|
