Sentence examples for order algorithm from inspiring English sources

In view of Figures 7 and 8, we see that, for the same value L=1, the second order algorithm outperforms the first order algorithm as it should.

However, as shown in the figures, the powerful second order algorithm with only L=3 can easily compete with the above two cases of first order algorithm.

We present an O(n2) order algorithm to an n-Tokyoites' loop-line commuter problem.

However, when the iteration number is increased sufficiently with the aid of an adjustment step size, the first order algorithm can be enhanced to outperform a second order algorithm with a low iteration number.

The low computing time of this zero order algorithm is also a great advantage to solve optimization problem.

A first order algorithm is applied for the numerical integration of the time-discretized equation of motion.

In the present study, a newly developed high order algorithm-the weak form quadrature element method is reformulated for upper bound limit analysis.

The result of the sixth-order algorithm is now added.

It is observed that, when (c_{2}) is null, the rectifying second-order algorithm (5) degenerates to the rectifying first-order algorithm (4).

A robust high-order algorithm is proposed to solve steady Euler equations on unstructured grids.

An efficient and high-order algorithm for three-dimensional bounded obstacle scattering is developed.