Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Machine Method for Solving Polynomial Equations - MaRDI portal

A Machine Method for Solving Polynomial Equations

From MaRDI portal
Publication:3291834

DOI10.1145/321062.321064zbMath0106.10203OpenAlexW2058651202WikidataQ29997845 ScholiaQ29997845MaRDI QIDQ3291834

D. H. Lehmer

Publication date: 1961

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321062.321064



Related Items

The multivariate bisection algorithm, Algebraic complexity of computing polynomial zeros, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Electromagnetic field generated by a modulated moving point source in a planarly layered waveguide, Improving a method of search for solving polynomial equations, Modified Newton method in circular interval arithmetic, A Numerical Method for Locating the Zeros of an Analytic Function, Solutions of infinite polynomial systems by iteration, A fast and simple modification of Newton's method avoiding saddle points, A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Generalized Fibonacci and Lucas Sequences and Rootfinding Methods, Numerical computation of polynomial zeros by means of Aberth's method, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, Polynomial zerofinders based on Szegő polynomials, An algorithm for the total, or partial, factorization of a polynomial, On Salem numbers, expansive polynomials and Stieltjes continued fractions, Exhaustive search methods for CNS polynomials, Ein konvergentes Iterationsverfahren zur Bestimmung der Nullstellen eines Polynoms, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Fehlerschranken zu Näherungswerten von Polynomwurzeln, Circular arithmetic and the determination of polynomial zeros, Locating multiple zeros interactively, Effective numerical method of spectral analysis of quantum graphs