Search Results for ""
281 - 290 of 1310 for Lagrange Interpolating PolynomialSearch Results
![](/common/images/search/spacer.gif)
A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...
Cribbage is a game in which each of two players is dealt a hand of six cards. Each player then discards two of his six cards to a four-card "crib" which alternates between ...
The quasiperiodic function defined by d/(dz)lnsigma(z;g_2,g_3)=zeta(z;g_2,g_3), (1) where zeta(z;g_2,g_3) is the Weierstrass zeta function and lim_(z->0)(sigma(z))/z=1. (2) ...
The functional derivative is a generalization of the usual derivative that arises in the calculus of variations. In a functional derivative, instead of differentiating a ...
The Diophantine equation x^2+y^2+z^2=3xyz. The Markov numbers m are the union of the solutions (x,y,z) to this equation and are related to Lagrange numbers.
Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...
The cubic formula is the closed-form solution for a cubic equation, i.e., the roots of a cubic polynomial. A general cubic equation is of the form z^3+a_2z^2+a_1z+a_0=0 (1) ...
The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...
Taylor's inequality is an estimate result for the value of the remainder term R_n(x) in any n-term finite Taylor series approximation. Indeed, if f is any function which ...
The Delta-variation is a variation in which the varied path over which an integral is evaluated may end at different times than the correct path, and there may be variation ...
![](/common/images/search/spacer.gif)
...