As a consequence, no analytical solution for solving this problem in a reasonable time is known to exist and one has to rely on approximation techniques.
The paper of Mursaleen et al. [11] is one of the latest references on approximation by q-analogue.
For exhaustive literature on approximation by linear positive operators one can refer to [5 7] and the references therein.
When β is sufficiently large, an analytical approach, based on approximation at infinity of both exact and approximate nth moments, is used to prove equality between them.
Simultaneously, we consider two closely related problems: the Stechkin problem on approximation of unbounded operators by bounded ones on a given class of elements Q, and the problem of optimal recovery of unbounded operator on the class Q under assumption that elements in Q are given with known error (for more information see [1, 2] and [[4], Section 7.1]).
Then, the ideal digital fractional delay operator z−α is approximated by a digital IIR filter based on approximation of analog fractional order system leading to an IIR digital filter implementation of the fractional Euler transform.
One way of studying non-smooth systems is a regularization process consisting on approximation of the discontinuous vector field by a one-parametric family of smooth vector fields, which is called a regularization of the discontinuous one.
In this study, a fast and reliable method for 3D reconstruction is proposed based on approximation of correlation functions and phase recovery algorithm using one and two perpendicular cut sections.
Concerning the approximation properties of operators and some results on approximation of functions of bounded variation by positive linear operators, one can refer to [2 7].
Thus, many variants based on approximation techniques, specially those from Swarm Intelligence (SI), have been proposed.
In this article, we investigate methods to develop bounds on approximation accuracy that involve local forgetting.
