Can we always find a root? The logic of constructive algorithms

Constructive Mathematics: Introduction to algorithms: rootfinding & fixed-point problems (1st Year) · 56:31 · Video: Oxford Mathematics · Watch at the source

In short: This lecture introduces the bisection method for identifying roots of non-polynomial functions. It explores the mechanics of rootfinding and fixed-point problems, explaining how these two mathematical challenges relate to one another within the framework of constructive mathematics.

In this third lecture of the Oxford undergraduate course on constructive mathematics, Patrick examines how algorithms solve equations that fall outside the scope of simple polynomials. By focusing on the bisection method, the lecture demonstrates a systematic approach to narrowing down the location of a function's root.

Beyond rootfinding, the session investigates fixed-point problems, where the goal is to find an input that remains unchanged by a function. Understanding the connection between these two concepts is fundamental to constructive analysis, providing students with the tools to reason about existence and computation in mathematics.

Opens the Intellect+ feed with this card first. Swipe up for the next one.

Sources

To cite this card, link to https://intellectplus.co.uk/app/science-constructive-mathematics-introduction-to-algorithms-rootfind.

How we source, check and correct cards: Editorial standards.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

Finding something worth knowing…