English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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