Open AccessOn the numerical solution of equations with complex roots
Publication year - 1929
Publication title -
proceedings of the royal society of london. series a, containing papers of a mathematical and physical character
Language(s) - English
Resource type - Journals
eISSN - 2053-9150
pISSN - 0950-1207
DOI - 10.1098/rspa.1929.0153
Subject(s) - arithmetic function , extension (predicate logic) , quadratic equation , computation , resolution (logic) , root (linguistics) , mathematics , bernoulli's principle , feature (linguistics) , interpretation (philosophy) , algebra over a field , computer science , algorithm , pure mathematics , mathematical analysis , artificial intelligence , engineering , geometry , linguistics , philosophy , programming language , aerospace engineering
1.Introduction .-Part I and II of the present paper give a brief description of two methods, which are believed to be substantially novel, for the numerical resolution of equations with complex roots. As regards rapidity of computation, the methods will probably be found inferior to others such as Aitken's extension of Bernoulli's method, or the root-squaring method as improved by Brodetsky and Smeal. On the other hand, a feature of the alternatives proposed is that arithmetical errors need not be cumulative. Certain further merits will be suggested in due course. Part III contains a résumé of Bairstow's variant of the root-squaring method, and Part IV deals with successive approximation to a quadratic factor. The substance of these parts has already appeared in aeronautical pulications, but may not be familiar to the general scientific public.