Results 31 to 40 of about 618,048 (272)
, 2014 Following K. Mahler's suggestion for further research on intrinsic approximation on the Cantor ternary set, we obtain a Dirichlet type theorem for the limit sets of rational iterated function systems.
Broderick +14 more
core +1 more source
Annales Polonici MathematiciThe aim of this paper is to review how some approximation results in commutative algebra are being used to construct equisingular deformations of singularities. The first example of such an approximation result appeared in A. Płoski’s PhD thesis.
Parusiński, Adam, Rond, Guillaume
openaire +2 more sources
Journal of Kufa for Mathematics and Computer, 2017 For a given nonnegative integer number n, we can find a monotone function f depending on n, defined on the interval I=[-1,1], and an absolute constant c>0, satisfying the following relationship: (2〖E_n (f Ì )〗_p)/(n+1)^3 ≤〖E_(n+1)^1 (f)〗_pâ ...
GHAZI ABDULLAH Madlol
doaj +1 more source
Modified Bernstein–Durrmeyer Type Operators
Mathematics, 2022 We constructed a summation–integral type operator based on the latest research in the linear positive operators area. We establish some approximation properties for this new operator.
Arun Kajla, Dan Miclǎuş
doaj +1 more source
Functional approximations with Stein's method of exchangeable pairs [PDF]
, 2020 We combine the method of exchangeable pairs with Stein's method for functional approximation. As a result, we give a general linearity condition under which an abstract Gaussian approximation theorem for stochastic processes holds. We apply this approach
Kasprzak, Mikolaj J.
core +1 more source
Approximate Euclidean Ramsey theorems [PDF]
J. Comput. Geom., 2010 According to a classical result of Szemerédi, every dense subset of 1,2,…,N contains an arbitrary long arithmetic progression, if N is large enough. Its analogue in higher dimensions due to Fürstenberg and Katznelson says that every dense subset of {1,2,…,N}d contains an arbitrary large grid, if N is large enough.
openaire +3 more sources
Formalization of a Stochastic Approximation Theorem
CoRR, 2022 Stochastic approximation algorithms are iterative procedures which are used to approximate a target value in an environment where the target is unknown and direct observations are corrupted by noise. These algorithms are useful, for instance, for root-finding and function minimization when the target function or model is not directly known.
Vajjha, Koundinya +3 more
openaire +4 more sources
A Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller
International Journal of Adaptive Control and Signal Processing, EarlyView.Block Diagram of the Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller. ABSTRACT This article introduces a discrete‐time robust adaptive one‐sample‐ahead preview super‐twisting sliding mode controller. A stability analysis of the controller by Lyapunov criteria is developed to demonstrate its robustness in handling both ...
Guilherme Vieira Hollweg +5 more
wiley +1 more source
Algorithms, 2019 This paper deals with an approximation of a first derivative of a signal using a dynamic system of the first order. After formulating the problem, a proposition and a theorem are proven for a possible approximation structure, which consists of a dynamic ...
Manuel Schimmack, Paolo Mercorelli
doaj +1 more source
Journal of Function Spaces, 2020 We define the notions of weighted λ,μ-statistical convergence of order γ1,γ2 and strongly weighted λ,μ-summability of γ1,γ2 for fuzzy double sequences, where ...
Abdullah Alotaibi
doaj +1 more source