Sentence examples for using an iteration procedure from inspiring English sources

(1.3) and obtained the existence of global attractors of (1.3) in (H^{k}) spaces by using an iteration procedure.

In order to construct it numerically, a simple transcendent equation, which relates the pressure and the velocity at the contact discontinuity, should be solved using an iteration procedure, just as in nonrelativistic CFD.

The final value of F y is determined using an iteration procedure such that the area under the idealized bi-linear curve approximates (with a maximum difference of 5%) that under the actual F Δ curve.

By using an iteration procedure, combining with the classical existence theorem of global attractors, we prove that this system possesses a global attractor, which attracts any bounded set of (H_{alpha}) in (H_{alpha} -norm.

Using an iteration procedure, regularity estimates for the linear semigroups and a classical existence theorem of global attractor, we prove that the extended Fisher-Kolmogorov equation possesses a global attractor in Sobolev space H k for all k > 0, which attracts any bounded subset of H k in the H k -norm.

By using an iteration procedure, regularity estimates for the linear semigroups and a classical existence theorem of a global attractor, they proved that problem (2 -(4) possesses a global attractor in the Sobolev space H k for all k ≥ 0, which attracts any bounded subset of H k in the H k -norm.

Each of these functions is then used as a building block for an approximation function, which is used in an iteration procedure to identify the physical parameters of the dynamical system considered.

In addition, the gas slip velocity in non-Newtonian power law fluids is rigorously determined by the proposed calculation procedure using an iteration approach.

DACTAL uses an iterative procedure, in which each iteration produces a decomposition of the taxa into four sets of the form S i = A i ∪ X, with A i ∩ A j =∅ for i≠ j, recursively computes a tree t i on each S i, and then combines the trees t1, t2, t3 and t4 using the SuperFine (Swenson et al., 2011) method.

During each iteration, a candidate nominal flux polyhedron is extruded using an iteration dependent scalar.

The first step is determination of the parameters of a background of an array – average (Av) and standard deviation (SD) – is performed using a special iteration procedure.