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

Alternative form of Euler method

Alternative form of Schwarzschild's method

Alternative form of Coppersmith method

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

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

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

The Dayi system of text input for Chinese characters.

(sciences) A method of discovering knowledge about the natural world based in making falsifiable predictions (hypotheses), testing them empirically, and developing theories that match known data from repeatable physical experimentation.