Sentence examples for discrete iterations from inspiring English sources

In previous research works, a technique that applies well-defined discrete iterations, satisfying the reputed Devaney's definition of chaos, has been developed.

Cellular automata and discrete iterations are used to model and simulate the release of bioactive agents (drugs) from bioerodible pellets used as controlled release devices.

In this paper, a mathematical model for the drug release from this type of three-dimensional (3D) drug delivery microstructures is presented by using 3D cellular automata and discrete iterations.

defined on a sample space Ω of a probability space ((Omega, mathcal {F}, P)), mapping into a measurable space ((Omega ', mathcal {F}')), and indexed by a totally ordered set T. In our case, Ω ′ refers to the discrete input space of the program and the index time T models the discrete iterations of test case generation, so we can assume (T = mathbb {N}).

Time in the simulation progressed in discrete iterations corresponding to the four seasons in a year of equal duration i.e. three months.

While this is in contrast to the discrete iteration used before, this is more in spirit of the original formulation of the renormalization group introduced in theoretical physics in 1974 [22].

The discrete approximate iteration method is designed to obtain the optimal portfolio strategy, and is proved convergent.

end{aligned} (44) Equation (44) is an element-local nonlinear algebraic equation that must be solved locally for each grid-cell in the unknowns (hat{mathbf{v}}^{n}_{l}). In practice, we solve the system of equations (44) through a discrete Picard iteration, see Dumbser and Zanotti (2009), Hidalgo and Dumbser (2011), where additional comments about its solution can be found.

In what follows, we use k as the node index, (mathcal {N}_{k}) denotes the set of neighbors of node k, N denotes the (known) number of nodes in the network, (mathcal {E}) the set of edges (links) of the network, d k the kth node degree ((d_{k}=|mathcal {N}_{k}|)), (bar {d}) the average node degree of the network, and t a discrete time (iteration) index.

The stability of the discrete-time iteration (112) can be proved in the same way as that proposed in [15].

where (x, y) denotes the coordinates of a pixel to be smoothed in the 2-D image domain, t denotes the discrete time step (iterations).