Sentence examples for at quadratic from inspiring English sources

which can be derived as the family of asymptotically equivalent shallow water wave equations that emerges at quadratic order accuracy for any b ≠ − 1 by an appropriate Kodama transformation.

Equation (1.3) can be derived as the family of asymptotically equivalent shallow water wave equations that emerge at quadratic order accuracy for any b ≠ 1 by an appropriate Kodama transformation; for the case b = − 1, the corresponding Kodama transformation is singular and the asymptotic ordering is violated; see [6], [7].

Specifically, when using orthogonal polynomials, the coefficients have the following natural interpretation, independently of other terms included: the coefficient at linear term represents an overall trend in the outcome profile, the coefficient at quadratic term is the rate of change in the expected outcome at time t, and so on [ 11].

It is assumed that f ( u ) and h ( t, u, ε ) are smooth functions with f ( u ) at least quadratic at the origin and satisfying suitable assumptions.

A notable exception from the latter "at-least-quadratic" rule is the GRAMMAR-Gamma method and a method based on low rank approximation of the similarity matrix - with the latter exploiting the ideas similar to EIGENSTRAT approach and the methods assuming the adjustment of the model for top Principal Components of the kinship matrix variation.

So a hotspot with peak day 7 and peak height 20 has a distribution whose mean starts at 0 on day 0, increases at a quadratic rate to a value of 20 on day 7 and similarly decreases until it is 0 again on day 15.

If bp0 is the expected number of children of a node whose costs are the same as that of their parent, then the expected number of nodes expanded by these three linear-space algorithms is exponential when bpo < 1, at most O d4) when bp0 = 1, and at most quadratic when bp0 > 1.

For example, some algorithms are specifically targeted to large, smooth unconstrained problems in which the matrix of second derivatives of f(x) contains few nonzero entries and is expensive to evaluate, while other algorithms are aimed specifically at convex quadratic programming problems, and so on.

On the other hand, deflection based on three equivalent curvature block is at most quadratic equation.

For this purpose, the original NL-ODEs are recast into nonlinear systems in which the nonlinearities are at most quadratic.

It is possible to construct examples where the repeat-until-loop must be ran times, resulting to at least quadratic worst case computational complexity.