(numerical analysis) Any of a class of iterative root-finding algorithms used for functions of one real variable with continuous derivatives up to some order d + 1, each method being characterized by the number d.

(calculus) A method to simplify integration by parts that precalculates the necessary derivatives and antiderivatives in a table.

Synonym of Tukey's range test

(object-oriented programming) A class method that cannot be extended, so it has to be inherited as it is.

The improved or modified Euler method (that is, the explicit trapezoidal rule). / A similar two-stage Runge-Kutta method.

A method of bulk crystal growth, involving a seed crystal dipped into molten alumina and slowly pulled and rotated to form a single large crystal.

A strategy to enhance one's memory ability by associating information with visualized spatial environments such as a "memory palace".

Synonym of Czochralski process

(mathematics) An iterative numerical method for finding a root of an equation f(x)=0, using a succession of roots of secant lines to better approximate the root.

(mathematics) A root-finding method that applies to any continuous functions for which one knows two values with opposite signs, and consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root.