Sentence examples for polynomial expressions from inspiring English sources

First order, partial second order and complete second order polynomial expressions are investigated.

This thesis examines several proposed ways to speed up symbolic algebraic computation: hashing techniques, parallel processing, application of the FFT, and alternative representations of polynomial expressions.

The algorithm learns structurally optimal polynomial expressions (polynomial expressions where both the architecture and the error function have been minimised over a dataset), through the use of specialised mutation and crossover operators.

For this purpose polynomial expressions have to be generated, which match known state combinations observed during experiments.

The complexity of the problem is examined in terms of the order of the polynomial expressions in the characteristic equation.

The results obtained were used to fit polynomial expressions, validated statistically, that predict the distillate yield and the PR for different operation strategies.

Since a polynomial expression can be recursively expressed as a system of bilinear equations, the proposed method, in principle, can be applied to all systems where polynomial non-convexities exist.

Also, a single polynomial expression modelling the reaction was obtained.

The single target function is similarly the conventional function multiplied by a polynomial expression in 1/t.

Also, a single polynomial expression modeling the reaction was obtained for both AOPs.

Polynomial expression is as accurate as state-space but its understanding and handling are much easier like transfer function.