A Machine Method for Solving Polynomial Equations

Cited in

(25)

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

This page was built for publication: A Machine Method for Solving Polynomial Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3291834)