Sentence examples for procedures for approximating from inspiring English sources

We designed three alternative procedures for approximating solutions to this problem.

One of the most popular iteration procedures for approximating a fixed point of is Picard's iteration defined by.

Also, studies either on approximate fixed point or on qualitative aspects of numerical procedures for approximating fixed points are available in the literature; see [4, 20, 21].

Also, there have been developed studies on approximate fixed point or on qualitative aspects of numerical procedures for approximating fixed points see, for example [19, 20].

In fact, the Picard iterative method is a well-known procedure for approximating the solution of stochastic differential equations (SDEs).

In this paper we propose a bootstrap procedure for approximating these distributions and their characteristics, and establish its consistency.

In 1953, Mann [1] introduced an iteration procedure for approximating fixed points of a nonexpansive mapping T in a Hilbert space.

First a simple practical procedure for approximating a stationary Gaussian process over a finite interval by a trigonometric polynomial with predetermined error is described.

A detailed procedure for approximating the bilinear softening curve from load CMOD data can be found in many sources (RILEM 1990; Guinea et al. 1994; Planas et al. 1999; Elices et al. 2002; RILEM report 2007; ACI 446 2009) and so the relevant aspects are only summarized here.

As underlined in the overview of the literature summarized here, almost all the recent, effective procedures designed for approximating optimal solutions to multi-objective combinatorial optimization problems are based on a blend of techniques, called hybrid metaheuristics.

We consider a new Noor-type iterative procedure with errors for approximating the common fixed point of a finite family of uniformly quasi-Lipschitzian mappings in convex metric spaces.