Translation of "Iteration step" in German

The corrected state serves as estimated state for a next iteration step.

The second iteration step is performed with the second nozzle coefficient a.

In this case, the respective iteration step is unambiguously identified by k.

However, with Pólya curves, the number of line segments merely doubles with each iteration step.

In the first iteration step, the test sequences consist only of the combination DNA sequences.

Firstly, the angle of attack for the current iteration step is determined with t.

With each iteration step the direct component contained in the ambience signals is reduced.

In one iteration step, only one or few parameters of the network configuration are changed.

The displacement vector d(i,j) determined in the first iteration step still has errors.

As a consequence thereof, the iteration loop of step S 30 can be skipped and a jump made to a step S 31 .

In this way the outlay involved in carrying out the estimation method is greatly reduced for each iteration step.

In step 105 a check is performed as to whether this is the first iteration step.

In each iteration step k, the local model network LMN is thus trained with these training data.

Finally, the method is continued with the freshly generated subset of data records in the next iteration step.

From the result of the test, the necessary variation of the network configuration in the next iteration step is derived.

The total variation (TV) of the volume model Fcorr corrected in terms of beams is minimized after each iteration step.

Here, each iteration does not necessarily have to represent an improvement with respect to the immediately preceding iteration step.

This method allows a comparatively simple implementation in which in each iteration step one equalization filter runs with a fed-back output the configuration of which resembles a FIR filter (Finite Impulse Response filter).

Usually, this "iteration step" suffices at the latest in order to obtain an ophthalmic lens according to the prescribed properties.

In the second case, following the aforementioned iteration step, more flocculant is used and then the throughput is again increased.

The method according to claim 8, wherein as a starting solution for selecting calibration curves to be compared, a calibration curve is used which has been selected as an appropriate solution in a preceding iteration step.

Depending on the iteration method, one or more matrix/vector products are calculated per iteration step, so that in the case of fully occupied matrices, O(N 2) floating-point operations are generally required for this.

The halving of the step size in each iteration step has the advantage that the approximate values can never leave the range of values formed by the first and second known values A, V--this follows mathematically from the finite series sum--whereby the family of characteristics can be further simplified.