Trapezoidal rule that Monte-Carlo integration is most likely a better choice, but for 2 and 3 dimensions, equispaced sampling is efficient. This is exploited in computational solid state physics where equispaced sampling over primitive cells in the reciprocal lattice is known as "Monkhorst-Pack integration". For various classes of functions that are not twice-differentiable, the trapezoidal rule has sharper bounds than Simpson's rule. The trapezoidal rule is one of a family of formulas for numerical integration called Newton–Cotes formulas, of which the midpoint rule is similar to the trapezoid rule. Simpson's rule is another member of the same family, and in general has
Bland's rule Research and Econometrics in Belgium. One uses Bland's rule during an iteration of the simplex method to decide first what column (known as the "entering variable") and then row (known as the "leaving variable") in the tableau to pivot on. Assuming that the problem is to minimize the objective function, the algorithm is loosely defined as follows: In the abstract setting of oriented matroids, Bland's rule cycles on some examples. A restricted class of oriented matroids on which Bland's rule avoids cycling has been termed "Bland oriented matroids" by Jack Edmonds. Another pivoting rule, the criss-cross algorithm, avoids cycles on