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.

## Approximation error

The approximation error in some data is the discrepancy between an exact value and some approximation to it.

New!!: Bisection method and Approximation error · See more »

## Binary search algorithm

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.

New!!: Bisection method and Binary search algorithm · See more »

## Bisection

In geometry, bisection is the division of something into two equal or congruent parts, usually by a line, which is then called a bisector.

New!!: Bisection method and Bisection · See more »

## Continuous function

In mathematics, a continuous function is a function for which sufficiently small changes in the input result in arbitrarily small changes in the output.

New!!: Bisection method and Continuous function · See more »

## Intermediate value theorem

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.

New!!: Bisection method and Intermediate value theorem · See more »

## Interval (mathematics)

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.

New!!: Bisection method and Interval (mathematics) · See more »

## Lehmer–Schur algorithm

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.

New!!: Bisection method and Lehmer–Schur algorithm · See more »

## Mathematics

Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.

New!!: Bisection method and Mathematics · See more »

## Nested intervals

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.

New!!: Bisection method and Nested intervals · See more »

## Pseudocode

Pseudocode is an informal high-level description of the operating principle of a computer program or other algorithm.

New!!: Bisection method and Pseudocode · See more »

## Rate of convergence

In numerical analysis, the speed at which a convergent sequence approaches its limit is called the rate of convergence.

New!!: Bisection method and Rate of convergence · See more »

## Real number

In mathematics, a real number is a value of a continuous quantity that can represent a distance along a line.

New!!: Bisection method and Real number · See more »

## Root-finding algorithm

In mathematics and computing, a root-finding algorithm is an algorithm for finding roots of continuous functions.

New!!: Bisection method and Root-finding algorithm · See more »

## Zero of a function

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

New!!: Bisection method and Zero of a function · See more »

## Redirects here:

Bisection algorithm, Bisection search, Interval bisection, Interval halving, Interval halving converges linearly, Method of bisection.