Lecture

Bisection Method: Proposition and Demonstration

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the bisection method, also known as the dichotomy method, focusing on a proposition and its demonstration regarding a continuous function within a closed interval. The proposition states conditions for the existence of a root, followed by a detailed proof.

In MOOCs (2)

Analysis I (part 5): Continuous and derivable functions, the derivative function

This brings us to the heart of our discussion of functions: the concept of the derivability of a function. We are particularly interested in the question of the continuity of derived functions. We begin the chapter by completing the study of continuous functions by studying their properties on closed intervals. This enables us to define the maximum and minimum of continuous functions. We go on to define the bisection method, and demonstrate it. Introducing the concepts of maximum and minimum allows us to

Analysis I

This course covers : Part 1: Prelude, basic concepts, real numbers. Part 2: Introduction to complex numbers. Part 3: Real number sequences I and II. Part 4: Limit of a function, continuous functions. Part 5: Continuous functions and derivable functions, the derivative function. Part 6: Studies of functions, limited developments. Part 7: Indefinite and definite integrals, integration (selected chapters).

Official source

Quiz

Ontological neighbourhood

Mathematics

Topology: General topology

Related concepts (24)

Root-finding algorithms

In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound).

Bisection method

In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. The method 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. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods.

Continuous function

In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in value, known as discontinuities. More precisely, a function is continuous if arbitrarily small changes in its value can be assured by restricting to sufficiently small changes of its argument. A discontinuous function is a function that is .

Unit interval

In mathematics, the unit interval is the closed interval , that is, the set of all real numbers that are greater than or equal to 0 and less than or equal to 1. It is often denoted I (capital letter ). In addition to its role in real analysis, the unit interval is used to study homotopy theory in the field of topology. In the literature, the term "unit interval" is sometimes applied to the other shapes that an interval from 0 to 1 could take: , , and . However, the notation I is most commonly reserved for the closed interval .

Brent's method

In numerical analysis, Brent's method is a hybrid root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation. It has the reliability of bisection but it can be as quick as some of the less-reliable methods. The algorithm tries to use the potentially fast-converging secant method or inverse quadratic interpolation if possible, but it falls back to the more robust bisection method if necessary. Brent's method is due to Richard Brent and builds on an earlier algorithm by Theodorus Dekker.

Related lectures (64)

Rolle's Theorem: Applications and Examples

Explores the practical applications of Rolle's Theorem in finding points where the derivative is zero.

Differential Calculus: Theorem of Finite Increments

Explains how a function reaches its maximum and minimum values.

Integration by Change of Variables MOOC: Analysis I (part 7) : Indefinite and definite integrals, integration (selected chapters)MOOC: Analysis I

Covers integration by change of variables and the derivation in chain rule.

Fundamental Theorem of Calculus Example MOOC: Analysis I (part 7) : Indefinite and definite integrals, integration (selected chapters)MOOC: Analysis I

Demonstrates the practical importance of the fundamental theorem of calculus through a detailed example.

The Intermediate Value Theorem MOOC: Analysis I (part 5): Continuous and derivable functions, the derivative function MOOC: Analysis I