(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.

(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.

Synonym of Czochralski process

A silver staining technique used to visualize nervous tissue under light microscopy.

(mathematics, computing theory) An algorithm for polynomial evaluation that employs Horner's rule.

Alternative form of Coppersmith method

(mathematics, cryptography) A method of finding small integer zeros of univariate or bivariate polynomials modulo a given integer. It forms the basis of Coppersmith's attack.

(botany) A method of classification based mainly on the difference in the number and position of the stamens and pistils of plants.

(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.