The project consists the source codes of our research paper that is submitting currently. Our paper discussed the numerical experiments within the Chebyshev polynoimal based crytosystem and Bergamo's ...
Kövari and Pommerenke [19], and Elliott [8], have shown that the truncated Faber series gives a polynomial approximation which (for practical values of the degree of the polynomial) is very close to ...
Two near minimax norms for polynomial approximation are presented. They are designed for approximation of both a function and its first derivative uniformly by polynomials over a given finite interval ...
ABSTRACT: Due to the ability to model various complex phenomena where classical calculus failed, fractional calculus is getting enormous attention recently. There are several approaches available for ...
Abstract: This paper explores the reliability of the Chebyshev collocation Method (CCM) as a numerical approach used for solving a specific class of equations known as the second-order Fredholm ...
ABSTRACT: In this note, we experimentally demonstrate, on a variety of analytic and nonanalytic functions, the novel observation that if the least squares polynomial approximation is repeated as ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback