14 relations: Approximation error, Binary search algorithm, Bisection, Continuous function, Intermediate value theorem, Interval (mathematics), Lehmer–Schur algorithm, Mathematics, Nested intervals, Pseudocode, Rate of convergence, Real number, Root-finding algorithm, Zero of a function.
The approximation error in some data is the discrepancy between an exact value and some approximation to it.
In computer science, binary search, also known as half-interval search,logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array.
In geometry, bisection is the division of something into two equal or congruent parts, usually by a line, which is then called a bisector.
In mathematics, a continuous function is a function for which sufficiently small changes in the input result in arbitrarily small changes in the output.
In mathematical analysis, the intermediate value theorem states that if a continuous function, f, with an interval,, as its domain, takes values f(a) and f(b) at each end of the interval, then it also takes any value between f(a) and f(b) at some point within the interval.
In mathematics, a (real) interval is a set of real numbers with the property that any number that lies between two numbers in the set is also included in the set.
In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of enclosing roots like in the one-dimensional bisection method to the complex plane.
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
In mathematics, a sequence of nested intervals is understood as a collection of sets of real numbers such that each set is an interval of the real line, for n.
Pseudocode is an informal high-level description of the operating principle of a computer program or other algorithm.
In numerical analysis, the speed at which a convergent sequence approaches its limit is called the rate of convergence.
In mathematics, a real number is a value of a continuous quantity that can represent a distance along a line.
In mathematics and computing, a root-finding algorithm is an algorithm for finding roots of continuous functions.
In mathematics, a zero, also sometimes called a root, of a real-, complex- or generally vector-valued function f is a member x of the domain of f such that f(x) vanishes at x; that is, x is a solution of the equation f(x).