Solving a Polynomial Equation: Some History and Recent Progress

68W30: Symbolic computation and algebraic computation

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65E05: General theory of numerical methods in complex analysis (potential theory, etc.)

65H05: Numerical computation of solutions to single equations

65Y20: Complexity and performance of numerical algorithms

65-03: History of numerical analysis

01-XX: History and biography

Related Items

On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables, Calibrating the Black-Derman-Toy model: some theoretical results, A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial, An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound, Computing multiple roots of inexact polynomials, Factoring multivariate polynomials via partial differential equations, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications, A computational comparison of the first nine members of a determinantal family of root-finding methods, On the geometry of Graeffe iteration, An algorithm for finding all solutions of a nonlinear system, A property of the nearly optimal root-bound, Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros, Numerical factorization of multivariate complex polynomials, A deterministic algorithm for isolating real roots of a real polynomial, Matrix computations and polynomial root-finding with preprocessing, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Relations between roots and coefficients, interpolation and application to system solving, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Coefficient-free adaptations of polynomial root-finders, Additive preconditioning, eigenspaces, and the inverse iteration, Enclosing all zeros of an analytic function - a rigorous approach, Complexity of Bezout's theorem. VII: Distance estimates in the condition metric, Dynamic ham-sandwich cuts in the plane, Computations with infinite Toeplitz matrices and polynomials, On solvents of matrix polynomials., A method for finding the zeros of polynomials using a companion matrix., Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Finding a cluster of zeros of univariate polynomials, Real computations with fake numbers, Improved algorithms for computing determinants and resultants, Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications, Symmetric functions and root-finding algorithms, Computation of approximate polynomial GCDs and an extension, On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem, Polynomial factorization through Toeplitz matrix computations, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Lifting/descending processes for polynomial zeros., A note on the finite variance of the averaging function for polynomial system solving, On general convergence in extracting radicals via a fundamental family of iteration functions, Real algebraic numbers and polynomial systems of small degree, Schur aggregation for linear systems and determinants, The amended DSeSC power method for polynomial root-finding, Additive preconditioning and aggregation in matrix computations, Stability of IMEX Runge-Kutta methods for delay differential equations, On the complexity of real root isolation using continued fractions, A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis, Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves, Computing real roots of a polynomial in Chebyshev series form through subdivision, Method for finding multiple roots of polynomials, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial, General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗

Uses Software