Type of algorithms for finding zeros of functions
Also known as root finding algorithm · numeric equation solving
8 statements · 50% with external sources · numbers in brackets are citations
5 identifiers linking root-finding algorithm across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In numerical analysis, a root-finding algorithm is an algorithm for finding zeros, also called roots, of a function. A root of the function f is a number x such that f(x) = 0. As the zeros typically cannot be computed exactly, nor expressed in closed form, root-finding algorithms provide approximations to the zeros. The functions considered are typically continuous or, for most algorithms, differentiable. For real functions and complex functions, the approximations are commonly expressed as floating-point numbers, sometimes with error bounds.