Sentence examples for studying approximation from inspiring English sources

On the contrary, the latter is preferred when studying approximation errors for PDEs.

Gupta [6] introduced and studied approximation properties of q-Durrmeyer operators.

In 1974, Khan [2] studied approximation of functions in various classes using differenttypes of operators.

Several authors have studied approximation of fixed points of several generalizations of nonexpansive mappings using Mann and Ishikawa iterations (see, e.g., [3 15]).

We apply the topological degree theory for condensing maps to study approximation of solutions to a fractional-order semilinear differential equation in a Banach space.

We study approximation algorithms for generalized network design where the cost of an edge depends on the identities of the demands using it (as a monotone subadditive function).

To break the "tensor barrier", we study approximation in a domain bounded by a "squircle", the zero isoline of B x,y)="x2ν+y2ν−1.

Park [5] studied approximation of derivations on (C^ -ternary algebras for the funC^ -ternaryalgebras_{mu}for_{1}, ldothe x_{p}, y_{1}, ldots, y_{d}) =0) (see also [5, 13, 15–59] and [60]).

Recently, Deǧer and Küçükaslan [33] generalized the concept of (DCM) and studied approximation of a function using deferred Nörlund mean/deferred Riesz mean in Hölder metric, which may be the future interest of investigators in this direction.

We study approximation of some well-known network design problems such as the traveling salesman problem (for both minimization and maximization versions) and the min steiner tree problem by moderately exponential algorithms.

The aim of this paper is to study approximation algorithms for a class of binary packing problems with quadratic constraints, where the constraint matrices are completely positive and have low cp-rank.