×
Login Register an account
Top Submissions Explore Upgoat Search Random Subverse Random Post Colorize! Site Rules Donate
0

Lehmer-Schur Algorithm for finding roots of polynomials by testing if a circle contains a root

submitted by happytoes to mathematics 5 monthsSep 14, 2025 15:18:23 ago (+0/-0)     (www.youtube.com)

https://www.youtube.com/watch?v=hT0EY2rxLlQ

The best root finding algorithm is Newton's method. But check out https://www.youtube.com/watch?v=I2sjchgXsmk which constructs a function such that Newton's method always get stuck in a cycle of three non roots.

Books on numerical methods mention the importance of having a method that works, even from a bad first guess. They mention Lehmer-Schur and then wimp out because "its too complicated".

This video actually explains it. Clearly. And its not too complicated :-) Or maybe it is, I haven't tried coding it up from the video.


0 comments block


There doesn't seem to be anything here yet