Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Constructive Mathematics: Introduction to algorithms: rootfinding & fixed-point problems (1st Year)
Play lesson

Student Lectures - All lectures - Constructive Mathematics: Introduction to algorithms: rootfinding & fixed-point problems (1st Year)

5.0 (4)
41 learners

What you'll learn

This course includes

  • 119.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

In this lecture, the third of the 'Constructive Mathematics' first year undergraduate course, Patrick introduces bisection, an algorithm for finding roots of general (non-polynomial) functions. He also discusses finding fixed points of functions and the relationship between fixed-point problems and rootfinding problems. You can watch many other student lectures via our main Student Lectures playlist (also check out specific student lectures playlists): https://www.youtube.com/playlist?list=PL4d5ZtfQonW0A4VHeiY0gSkX1QEraaacE All first and second year lectures are followed by tutorials where students meet their tutor to go through the lecture and associated problem sheet and to talk and think more about the maths. Third and fourth year lectures are followed by classes.

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere