Results 21 to 30 of about 1,307,940 (306)
Journal of Inequalities and Applications, 2012 In this paper, we determine the degree of approximation of the conjugate of 2π-periodic signals (functions) belonging to Lip(α,r ...
S. Sonker, Uaday Singh
semanticscholar +1 more source
On certain Baskakov-Durrmeyer type operators [PDF]
Surveys in Mathematics and its Applications, 2010 This paper is a study of the degree of approximation by the linear combinations of the derivatives of certain Durrmeyer type integral modification of the Baskakov operators in terms of the higher order modulus of smoothness.
Asha Ram Gairola
doaj
The approximation of bivariate Chlodowsky-Szász-Kantorovich-Charlier-type operators
Journal of Inequalities and Applications, 2017 In this paper, we introduce a bivariate Kantorovich variant of combination of Szász and Chlodowsky operators based on Charlier polynomials. Then, we study local approximation properties for these operators.
Purshottam Narain Agrawal +2 more
doaj +1 more source
Approximation of functions by (C,2)(E,1) product summability method of Fourier series
Ratio Mathematica, 2020 Various investigators such as Leindler [10], Chandra [1], Mishra et al. [7], Khan [11], Kushwaha [6] have determined the degree of approximation of 2 pai-periodic functions belonging to generalized Lipschitz class of functions through trigonometric ...
Jitendra Kumar Kushwaha
doaj +1 more source
Diophantine Approximation in Prescribed Degree [PDF]
Moscow Mathematical Journal, 2018 25 ...
openaire +2 more sources
Journal of Inequalities and Applications, 2016 To start with, signals are dealt with as functions of one variable and images are shown by elements of two variables. The investigation of these ideas is directly related to the transpiring area of information technology.
Deepmala, Laurian-Ioan Piscoran
doaj +1 more source
Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees
, 2020 Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the
G Yao +6 more
core +1 more source
Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP [PDF]
, 2010 Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple semidefinite ...
Yoshida, Yuichi
core +1 more source
Asymptotic behavior of solutions to difference equations in Banach spaces
Electronic Journal of Qualitative Theory of Differential Equations, 2021 We investigate the asymptotic properties of solutions to higher order nonlinear difference equations in Banach spaces. We introduce a new technique based on a vector version of discrete L'Hospital's rule, remainder operator, and the regional topology on ...
Janusz Migda
doaj +1 more source
The geodesic approximation for lump dynamics and coercivity of the Hessian for harmonic maps [PDF]
, 2003 The most fruitful approach to studying low energy soliton dynamics in field theories of Bogomol'nyi type is the geodesic approximation of Manton.
Adams D. +17 more
core +2 more sources