Sentence examples for a problem of approximating from inspiring English sources

This is done by demonstrating that the problem of constructing central difference stencils that have minimal dispersion error in the infinity norm can be recast into a problem of approximating a continuous function from a finite dimensional subspace with a basis forming a Chebyshev set.

At its core, anatomical interpretation is a problem of approximating the spatial pattern of an ion with a combination of patterns selected from a provided vocabulary of anatomical patterns.

In this paper, based on a general iterative algorithm, we study the problem of approximating a common element in the common fixed point set of an infinite family of nonexpansive mappings, in the solution set of a variational inequality involving an inverse-strongly monotone mapping and in the solution set of an equilibrium problem.

The study of the Korovkin type approximation theory is a well-established area of research, which is concerned with the problem of approximating a function f by means of a sequence (A_{n}) of positive linear operators.

Second, we consider the problem of approximating a solution of a family of variational inequalities.

In this paper, we are concerned with the problem of approximating a solution of an ill-posed biparabolic problem in the abstract setting.

We conclude by proposing a solution to the general problem of approximating the spectrum of an arbitrary bounded operator by introducing the n-pseudospectrum and argue how that can be used as an approximation to the spectrum.

First, we consider the problem of approximating a common minimizer of a family of proper, lower semicontinuous, and convex functionals.

Second, we consider the problem of approximating a common fixed point of a pair of nonexpansive mappings.

Actually, the problem of approximating a long FIR filter by a pole-zero filter with a small total number of coefficients had been investigated by many researchers [17, 18], some of them had especially developed a stable pole-zero model of the DSL loop as a way to reduce the implementation complexity of the DSL channel equalization [9].

This paper considers the problem of approximating a given crystallite orientation distribution function (codf) by a set of texture components.