A Machine Method for Solving Polynomial Equations

Cited in

(25)

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

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)