Lill's method

Last updated
Finding roots -2, -1 (repeated root), and -1/3 of the quartic 3x +13x +19x +11x+2 using Lill's method. Black segments are labeled with their lengths (coefficients in the equation), while each colored line with initial slope m and the same endpoint corresponds to a real root. Lill method quartic example.svg
Finding roots −2, −1 (repeated root), and −1/3 of the quartic 3x +13x +19x +11x+2 using Lill's method. Black segments are labeled with their lengths (coefficients in the equation), while each colored line with initial slope m and the same endpoint corresponds to a real root.

In mathematics, Lill's method is a visual method of finding the real roots of a univariate polynomial of any degree. [1] It was developed by Austrian engineer Eduard Lill in 1867. [2] A later paper by Lill dealt with the problem of complex roots. [3]

Contents

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.

Description of the method

Finding roots -1/2, -1/[?]2, and 1/[?]2 of the cubic 4x +2x -2x-1 showing how negative coefficients and extended segments are handled. Each number shown on a colored line is the negative of its slope and hence a real root of the polynomial. LillsMethod.svg
Finding roots −1/2, −1/2, and 1/2 of the cubic 4x +2x −2x−1 showing how negative coefficients and extended segments are handled. Each number shown on a colored line is the negative of its slope and hence a real root of the polynomial.

To employ the method a diagram is drawn starting at the origin. A line segment is drawn rightwards by the magnitude of the first coefficient (the coefficient of the highest-power term) (so that with a negative coefficient the segment will end left of the origin). From the end of the first segment another segment is drawn upwards by the magnitude of the second coefficient, then left by the magnitude of the third, and down by the magnitude of the fourth, and so on. The sequence of directions (not turns) is always rightward, upward, leftward, downward, then repeating itself. Thus each turn is counterclockwise. The process continues for every coefficient of the polynomial including zeroes, with negative coefficients "walking backwards". The final point reached, at the end of the segment corresponding to the equation's constant term, is the terminus.

A line is then launched from the origin at some angle θ, reflected off of each line segment at a right angle (not necessarily the "natural" angle of reflection), and refracted at a right angle through the line through each segment (including a line for the zero coefficients) when the angled path does not hit the line segment on that line. [4] The vertical and horizontal lines are reflected off or refracted through in the following sequence: the line containing the segment corresponding to the coefficient of then of etc. Choosing θ so that the path lands on the terminus, the negative of the tangent of θ is a root of this polynomial. For every real zero of the polynomial there will be one unique initial angle and path that will land on the terminus. A quadratic with two real roots, for example, will have exactly two angles that satisfy the above conditions.

For complex roots, one also needs to find a series of similar triangles, but with the vertices of the root path displaced from the polynomial path by a distance equal to the imaginary part of the root. In this case the root path will not be rectangular. [5] [3]

Explanation

The construction in effect evaluates the polynomial according to Horner's method. For the polynomial the values of , , are successively generated as distances between the vertices of the polynomial and root paths. For a root of the polynomial the final value is zero, so the last vertex coincides with the polynomial path terminus.

Additional properties

A solution line giving a root is similar to the Lill's construction for the polynomial with that root removed, because the visual construction is analogous to the synthetic division of the polynomial by a linear (root) monic (Ruffini's rule).

From the symmetry of the diagram, it can easily be seen that the roots of the reversed polynomial are the reciprocals of the original roots.

The construction can also be done using clockwise turns instead of counterclockwise turns. When a path is interpreted using the other convention, it corresponds to the mirrored polynomial (every odd coefficient sign changed) and the roots are negated.

When the right-angle path is traversed in the other direction but the same direction convention, it corresponds to the reversed mirrored polynomial and the roots are the negative reciprocals of the original roots. [4]

Finding quadratic roots using Thales's theorem

Finding roots of 3x +5x-2 Lill method quadratic example.svg
Finding roots of 3x +5x−2

Lill's method can be used with Thales's theorem to find the real roots of a quadratic polynomial.

In this example with 3x2+5x−2, the polynomial's line segments are first drawn in black, as above. A circle is drawn with the straight line segment joining the start and end points forming a diameter.

According to Thales's theorem, the triangle containing these points and any other point on the circle is a right triangle. Intersects of this circle with the middle segment of Lill's method, extended if needed, thus define the two angled paths in Lill's method, coloured blue and red.

The negative of the gradients of their first segments, m, yield the real roots 1/3 and 2.

Finding roots using paper folding

Find roots of 3x +2x -7x+2 Lill method folding example.svg
Find roots of 3x +2x −7x+2

In 1936 Margherita Piazzola Beloch showed how Lill's method could be adapted to solve cubic equations using paper folding. [6] If simultaneous folds are allowed then any nth degree equation with a real root can be solved using n–2 simultaneous folds. [7]

In this example with 3x3+2x2−7x+2, the polynomial's line segments are first drawn on a sheet of paper (black). Lines passing through reflections of the start and end points in the second and third segments, respectively (faint circle and square), and parallel to the them (grey lines) are drawn.

For each root, the paper is folded until the start point (black circle) and end point (black square) are reflected onto these lines. The axis of reflection (dash-dot line) defines the angled path corresponding to the root (blue, purple and red). The negative of the gradients of their first segments, m, yield the real roots 1/3, 1 and 2.

See also

Related Research Articles

<span class="mw-page-title-main">Constructible number</span> Number constructible via compass and straightedge

In geometry and algebra, a real number is constructible if and only if, given a line segment of unit length, a line segment of length can be constructed with compass and straightedge in a finite number of steps. Equivalently, is constructible if and only if there is a closed-form expression for using only integers and the operations for addition, subtraction, multiplication, division, and square roots.

In mathematics, a polynomial is an expression consisting of indeterminates and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2yz + 1.

In algebra, a quadratic equation is any equation that can be rearranged in standard form as

The fundamental theorem of algebra, also known as d'Alembert's theorem, or the d'Alembert–Gauss theorem, states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since every real number is a complex number with its imaginary part equal to zero.

In mathematics, the discriminant of a polynomial is a quantity that depends on the coefficients and allows deducing some properties of the roots without computing them. More precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number theory, and algebraic geometry.

<span class="mw-page-title-main">Quadratic formula</span> Formula that provides the solutions to a quadratic equation

In elementary algebra, the quadratic formula is a formula that provides the two solutions, or roots, to a quadratic equation. There are other ways of solving a quadratic equation instead of using the quadratic formula, such as completing the square.

<span class="mw-page-title-main">Factorization</span> (Mathematical) decomposition into a product

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4.

<span class="mw-page-title-main">Angle trisection</span> Construction of an angle equal to one third a given angle

Angle trisection is a classical problem of straightedge and compass construction of ancient Greek mathematics. It concerns construction of an angle equal to one third of a given arbitrary angle, using only two tools: an unmarked straightedge and a compass.

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).

<span class="mw-page-title-main">Cubic equation</span> Polynomial equation of degree 3

In algebra, a cubic equation in one variable is an equation of the form

<span class="mw-page-title-main">Quadratic function</span> Polynomial function of degree two

In mathematics, a quadratic polynomial is a polynomial of degree two in one or more variables. A quadratic function is the polynomial function defined by a quadratic polynomial. Before the 20th century, the distinction was unclear between a polynomial and its associated polynomial function; so "quadratic polynomial" and "quadratic function" were almost synonymous. This is still the case in many elementary courses, where both terms are often abbreviated as "quadratic".

<span class="mw-page-title-main">Quartic function</span> Polynomial function of degree four

In algebra, a quartic function is a function of the form

In mathematics, an algebraic equation or polynomial equation is an equation of the form , where P is a polynomial with coefficients in some field, often the field of the rational numbers. For example, is an algebraic equation with integer coefficients and

In numerical analysis, Bairstow's method is an efficient algorithm for finding the roots of a real polynomial of arbitrary degree. The algorithm first appeared in the appendix of the 1920 book Applied Aerodynamics by Leonard Bairstow. The algorithm finds the roots in complex conjugate pairs using only real arithmetic.

In mathematics, a quadratic equation is a polynomial equation of the second degree. The general form is

In mathematics, a univariate polynomial of degree n with real or complex coefficients has n complex roots, if counted with their multiplicities. They form a multiset of n points in the complex plane. This article concerns the geometry of these points, that is the information about their localization in the complex plane that can be deduced from the degree and the coefficients of the polynomial.

The Jenkins–Traub algorithm for polynomial zeros is a fast globally convergent iterative polynomial root-finding method published in 1970 by Michael A. Jenkins and Joseph F. Traub. They gave two variants, one for general polynomials with complex coefficients, commonly known as the "CPOLY" algorithm, and a more complicated variant for the special case of polynomials with real coefficients, commonly known as the "RPOLY" algorithm. The latter is "practically a standard in black-box polynomial root-finders".

<span class="mw-page-title-main">Irrational number</span> Number that is not a ratio of integers

In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being incommensurable, meaning that they share no "measure" in common, that is, there is no length, no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.

In mathematics, a Carlyle circle is a certain circle in a coordinate plane associated with a quadratic equation; it is named after Thomas Carlyle. The circle has the property that the solutions of the quadratic equation are the horizontal coordinates of the intersections of the circle with the horizontal axis. Carlyle circles have been used to develop ruler-and-compass constructions of regular polygons.

Finding polynomial roots is a long-standing problem that has been the object of much research throughout history. A testament to this is that up until the 19th century, algebra meant essentially theory of polynomial equations.

References

  1. Dan Kalman (2009). Uncommon Mathematical Excursions: Polynomia and Related Realms . AMS. pp.  13–22. ISBN   978-0-88385-341-2.
  2. M. E. Lill (1867). "Résolution graphique des équations numériques de tous degrés à une seule inconnue, et description d'un instrument inventé dans ce but" (PDF). Nouvelles Annales de Mathématiques . 2. 6: 359–362.
  3. 1 2 M. E. Lill (1868). "Résolution graphique des équations algébriques qui ont des racines imaginaires" (PDF). Nouvelles Annales de Mathématiques . 2. 7: 363–367.
  4. 1 2 Bradford, Phillips Verner. "Visualizing solutions to n-th degree algebraic equations using right-angle geometric paths". www.concentric.net. Archived from the original on 2 May 2010. Retrieved 3 February 2012.
  5. Tabachnikov, Serge (2017-03-01). "Polynomials as Polygons" (PDF). The Mathematical Intelligencer. 39 (1): 41–43. doi:10.1007/s00283-016-9681-y. ISSN   1866-7414. S2CID   126072703.
  6. Thomas C. Hull (April 2011). "Solving Cubics With Creases: The Work of Beloch and Lill" (PDF). American Mathematical Monthly. 118 (4): 307–315. doi:10.4169/amer.math.monthly.118.04.307. S2CID   2540978.
  7. Roger C. Alperin; Robert J. Lang (2009). "One-, Two-, and Multi-Fold Origami Axioms" (PDF). 4OSME. A K Peters.