Sentence examples for approximation to the general from inspiring English sources

As follows from Fig. 5, the simplified growth equation at L/λ f → 0 is a good approximation to the general expressions for the parameters considered.

Several authors have expressed the need to use the BDI-II to test the models in student populations across cultures because of their homogeneity and comparability [ 14, 16- 18, 26, 27, 29]; and the sample of college students was found to be useful in the original validation studies of the BDI-II because it is a close approximation to the general population [ 12].

We then extend our approximation to the more general k-majority voting games and show that, for n players, the method has time complexity O k2n) and the upper bound on its approximation error is O k2/√n).

In this article, we study superconvergence of the finite element approximation to the solution of a general second-order elliptic boundary value problem in three dimensions over a fully uniform mesh of piecewise tensor-product linear triangular prism elements.

We obtain the 1-loop approximation to the effective action for general (space-) translation invariant systems, and thus approximations to the non-equilibrium dynamics of the mean fields.

Moreover, by using the generalized resolvent operator technique associated with relative ( A, η ) -maximal monotone operators, we also construct some new iterative algorithms for finding approximation solutions to the general systems of set-valued variational inclusions and prove convergence of the sequences generated by the algorithms.

By using the generalized resolvent operator technique associated with relative ( A, η ) -maximal monotone operators, we also construct some new iterative algorithms for finding approximation solutions to the general systems of set-valued variational inclusions and prove the convergence of the sequences generated by the algorithms.

We further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem, and propose a simple distributed 2-approximation solution with a small message overhead.

They further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem and propose a simple distributed 2-approximation solution with a small message overhead.

A value of close to zero gives a good approximation to the slope of the tangent line, and smaller values (in absolute value) of will, in general, give better approximations.

We further extend the Chebyshev approximation to treat general functions of matrices, thus allowing its application to cases for which no analytical expressions of the expansion coefficients are available.