A Story of Computational Science: Colonel Titus’ Problem from the 17th Century
Experimentation and the evaluation of algorithms have a long history in algebra. In this paper we follow a single test example over more than 250 years. In 1685, John Wallis published <i>A treatise of algebra, both historical and practical</i>, containing a solution of Colonel Titus’ pro...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-06-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/11/6/287 |
| _version_ | 1827662413166542848 |
|---|---|
| author | Trond Steihaug |
| author_facet | Trond Steihaug |
| author_sort | Trond Steihaug |
| collection | DOAJ |
| description | Experimentation and the evaluation of algorithms have a long history in algebra. In this paper we follow a single test example over more than 250 years. In 1685, John Wallis published <i>A treatise of algebra, both historical and practical</i>, containing a solution of Colonel Titus’ problem that was proposed to him around 1650. The Colonel Titus problem consists of three algebraic quadratic equations in three unknowns, which Wallis transformed into the problem of finding the roots of a fourth-order (quartic) polynomial. When Joseph Raphson published his method in 1690, he demonstrated the method on 32 algebraic equations and one of the examples was this quartic equation. Edmund Halley later used the same polynomial as an example for his new methods in 1694. Although Wallis used the method of Vietè, which is a digit–by–digit method, the more efficient methods of Halley and Raphson are clearly demonstrated in the works by Raphson and Halley. For more than 250 years the quartic equation has been used as an example in a wide range of solution methods for nonlinear equations. This paper provides an overview of the Colonel Titus problem and the equation first derived by Wallis. The quartic equation has four positive roots and the equation has been found to be very useful for analyzing the number of roots and finding intervals for the individual roots, in the Cardan–Ferrari direct approach for solving quartic equations, and in Sturm’s method of determining the number of real roots of an algebraic equation. The quartic equation, together with two other algebraic equations, have likely been the first set of test examples used to compare different iteration methods of solving algebraic equations. |
| first_indexed | 2024-03-10T00:24:46Z |
| format | Article |
| id | doaj.art-649095bc20da4a25b2b805a690918639 |
| institution | Directory Open Access Journal |
| issn | 2075-1680 |
| language | English |
| last_indexed | 2024-03-10T00:24:46Z |
| publishDate | 2022-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Axioms |
| spelling | doaj.art-649095bc20da4a25b2b805a6909186392023-11-23T15:35:32ZengMDPI AGAxioms2075-16802022-06-0111628710.3390/axioms11060287A Story of Computational Science: Colonel Titus’ Problem from the 17th CenturyTrond Steihaug0Department of Informatics, University of Bergen, N-5020 Bergen, NorwayExperimentation and the evaluation of algorithms have a long history in algebra. In this paper we follow a single test example over more than 250 years. In 1685, John Wallis published <i>A treatise of algebra, both historical and practical</i>, containing a solution of Colonel Titus’ problem that was proposed to him around 1650. The Colonel Titus problem consists of three algebraic quadratic equations in three unknowns, which Wallis transformed into the problem of finding the roots of a fourth-order (quartic) polynomial. When Joseph Raphson published his method in 1690, he demonstrated the method on 32 algebraic equations and one of the examples was this quartic equation. Edmund Halley later used the same polynomial as an example for his new methods in 1694. Although Wallis used the method of Vietè, which is a digit–by–digit method, the more efficient methods of Halley and Raphson are clearly demonstrated in the works by Raphson and Halley. For more than 250 years the quartic equation has been used as an example in a wide range of solution methods for nonlinear equations. This paper provides an overview of the Colonel Titus problem and the equation first derived by Wallis. The quartic equation has four positive roots and the equation has been found to be very useful for analyzing the number of roots and finding intervals for the individual roots, in the Cardan–Ferrari direct approach for solving quartic equations, and in Sturm’s method of determining the number of real roots of an algebraic equation. The quartic equation, together with two other algebraic equations, have likely been the first set of test examples used to compare different iteration methods of solving algebraic equations.https://www.mdpi.com/2075-1680/11/6/287Vietè’s methodNewton–Raphson methodregula falsi methodtesting of algorithms |
| spellingShingle | Trond Steihaug A Story of Computational Science: Colonel Titus’ Problem from the 17th Century Axioms Vietè’s method Newton–Raphson method regula falsi method testing of algorithms |
| title | A Story of Computational Science: Colonel Titus’ Problem from the 17th Century |
| title_full | A Story of Computational Science: Colonel Titus’ Problem from the 17th Century |
| title_fullStr | A Story of Computational Science: Colonel Titus’ Problem from the 17th Century |
| title_full_unstemmed | A Story of Computational Science: Colonel Titus’ Problem from the 17th Century |
| title_short | A Story of Computational Science: Colonel Titus’ Problem from the 17th Century |
| title_sort | story of computational science colonel titus problem from the 17th century |
| topic | Vietè’s method Newton–Raphson method regula falsi method testing of algorithms |
| url | https://www.mdpi.com/2075-1680/11/6/287 |
| work_keys_str_mv | AT trondsteihaug astoryofcomputationalsciencecoloneltitusproblemfromthe17thcentury AT trondsteihaug storyofcomputationalsciencecoloneltitusproblemfromthe17thcentury |