Horner versus Holdred: An episode in the history of root computation
type: Item
instance of: scholarly article
title: Horner versus Holdred: An episode in the history of root computation
zbMATH Open document ID: 0935.01005
author: A. T. Fuller
published in: Historia Mathematica
publication date: 2000-04-25T00:00:00Z
review text: The methods of Holdred and Horner are given in summary form, not immediately transparent. Holdred developed Viète's method and showed it to Nicholson; Nicholson was the first to publish a revised form of Holdred's algorithm with attribution, and engendered controversy after Holdred published. Horner published last, plagiarising Holdred, without any attribution to Viète or Holdred, but with proofs Holdred could not supply. There are five letters, and 82 references.
Mathematics Subject Classification ID: 01A55
Mathematics Subject Classification ID: 01A70
Mathematics Subject Classification ID: 01A80
Mathematics Subject Classification ID: 65-03
zbMATH DE Number: 1274789
zbMATH Keywords: roots of algebraic equations,
zbMATH Keywords: Horner
zbMATH Keywords: Holdred
zbMATH Keywords: Vieète
MaRDI profile type: Publication
cites work: Q3028911
cites work: Sur la vie et l'oeuvre de François Budan (1761--1840). (On the life and work of F. Budan)
cites work: Q3269155
cites work: Q4261064
cites work: Q5790779
cites work: Q5557859
cites work: Q3781705
cites work: Convolutions in French mathematics, 1800-1840. Volume I: The settings. Volume II: The turns. Volume III: The data
cites work: Q3998994
cites work: Q5843784
cites work: Q5732600
cites work: Q4041486
cites work: Mr Peter Nicholson, The Practical Builder and Mathematician
cites work: Résolution des équations numériques et algèbre: Šaraf-al-Din al-Tūsī, Viète
cites work: Augustus De Morgan (1806-1871)
cites work: Mathematics in the metropolis: a survey of Victorian London
cites work: Q5781321
cites work: Q5519096
cites work: Q5831431
cites work: Q4099569
Recommended article: On the cost of computing roots of polynomials
Recommended article: On K nig's root-finding algorithms*
Recommended article: Old and new nearly optimal polynomial root-finders
Recommended article: Rationalizing roots: an algorithmic approach
Recommended article: Revisiting the stability of computing the roots of a quadratic polynomial
Recommended article: A Refinement of H. C. Williams' qth Root Algorithm
Recommended article: Q4495303
Recommended article: Computers and the Multiplicity of Polynomial Roots
Recommended article: On Accurate Computations of the Perron Root
description: scientific article; zbMATH DE number 1274789