Lill's Method Algorithm
Jump to navigation
Jump to search
A Lill's Method Algorithm is a Visual Representation Algorithm for finding univariate polynomial roots.
- Example(s):
- Counter-Example(s):
- See: Slope, Mathematics, Real Number, Zero of a Function, Polynomial, Degree of a Polynomial, Eduard Lill, Nouvelles Annales de Mathématiques, Complex Numbers, Right Angle.
References
2021
- (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Lill's_method Retrieved:2021-9-5.
- In mathematics, Lill's method is a visual method of finding the real roots of a univariate polynomial of any degree. It was developed by Austrian engineer Eduard Lill in 1867. A later paper by Lill dealt with the problem of complex roots.
Lill's method involves drawing a path of straight line segments making right angles, with lengths equal to the coefficients of the polynomial. The roots of the polynomial can then be found as the slopes of other right-angle paths, also connecting the start to the terminus, but with vertices on the lines of the first path.
- In mathematics, Lill's method is a visual method of finding the real roots of a univariate polynomial of any degree. It was developed by Austrian engineer Eduard Lill in 1867. A later paper by Lill dealt with the problem of complex roots.