Solving a Polynomial Equation: Some History and Recent Progress
From MaRDI portal
Publication:4340817
DOI10.1137/S0036144595288554zbMath0873.65050OpenAlexW1995250895WikidataQ56474086 ScholiaQ56474086MaRDI QIDQ4340817
Publication date: 12 June 1997
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036144595288554
historical surveycomputer algebrapolynomial equationcomplex polynomial zerosdivide-and-conquer algorithmsWeyl's quadtree algorithm
Symbolic computation and algebraic computation (68W30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20) History of numerical analysis (65-03) History and biography (01-XX)
Related Items
Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues, Validated Root Enclosures for Interval Polynomials with Multiplicities, A Newton’s iteration converges quadratically to nonisolated solutions too, Matrix approach to solve polynomial equations, Attractor-repeller construction of Shintani domains for totally complex quartic fields, Unnamed Item, 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 CMV-Based Eigensolver for Companion Matrices, Effective numerical method of spectral analysis of quantum graphs, Polynomial factorization through Toeplitz matrix computations, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, Factoring multivariate polynomials via partial differential equations, On general convergence in extracting radicals via a fundamental family of iteration functions, Deterministic root finding over finite fields using Graeffe transforms, Characterization of local optima of polynomial modulus over a disc, Calibrating the Black-Derman-Toy model: some theoretical results, Real algebraic numbers and polynomial systems of small degree, Schur aggregation for linear systems and determinants, Computations with infinite Toeplitz matrices and polynomials, On the convergence of Chebyshev's method for multiple polynomial zeros, Finding the number of roots of a polynomial in a plane region using the winding number, The Weierstrass–Durand–Kerner root finder is not generally convergent, Electromagnetic field generated by a modulated moving point source in a planarly layered waveguide, The amended DSeSC power method for polynomial root-finding, A symbolic-numerical algorithm for isolating real roots of certain radical expressions, 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, Fast algorithms for solving the inverse scattering problem for the Zakharov-Shabat system of equations and their applications, Numerical factorization of multivariate complex polynomials, A deterministic algorithm for isolating real roots of a real polynomial, Improved bounds for the CF algorithm, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods, Matrix computations and polynomial root-finding with preprocessing, Additive preconditioning and aggregation in matrix computations, Efficient polynomial root-refiners: a survey and new record efficiency estimates, On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity, A fitting algorithm for real coefficient polynomial rooting, A geometric algorithm for winding number computation with complexity analysis, The computation of multiple roots of a polynomial, Geometry of polynomials and root-finding via path-lifting, On solvents of matrix polynomials., Algorithms for quaternion polynomial root-finding, Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems, A method for finding the zeros of polynomials using a companion matrix., On the complexity of the Descartes method when using approximate arithmetic, Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method, A general approach to isolating roots of a bitstream polynomial, Globally convergent, iterative path-following for algebraic equations, SqFreeEVAL: An (almost) optimal real-root isolation algorithm, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Overdetermined Weierstrass iteration and the nearest consistent system, Real forms of the complex Neumann system: a method for finding real roots of polynomial \(U_{\mathcal{S}} ( \lambda )\), Root-finding by expansion with independent constraints, Root refinement for real polynomials using quadratic interval refinement, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Lifting/descending processes for polynomial zeros., An adaptive subdivision method for root finding of univariate polynomials, Computing real roots of real polynomials, Routh-type table test for zero distribution of polynomials with commensurate fractional and integer degrees, Stability of IMEX Runge-Kutta methods for delay differential equations, Additive preconditioning, eigenspaces, and the inverse iteration, On the complexity of real root isolation using continued fractions, 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, Root finding with threshold circuits, A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗, Rational inversion of the Laplace transform, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, 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, 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, Enclosing all zeros of a system of analytic functions, Exponential bounds for intensity of jumps, Fitting \(C^2\) continuous parametric surfaces to frontiers delimiting physiologic structures, Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves, New progress in real and complex polynomial root-finding, A note on the finite variance of the averaging function for polynomial system solving, Symmetric functions and root-finding algorithms, Computing real roots of a polynomial in Chebyshev series form through subdivision, Method for finding multiple roots of polynomials, Matrix exponentials, SU(N) group elements, and real polynomial roots, Real root polynomials and real root preserving transformations, Newton–Ellipsoid polynomiography, An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial, On the stability of computing polynomial roots via confederate linearizations, On the determination of the number of positive and negative polynomial zeros and their isolation, 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, Computing singular points of projective plane algebraic curves by homotopy continuation methods, Computational aspects of the general Rodrigues problem, An effective implementation of a modified Laguerre method for the roots of a polynomial, The polynomial pivots as initial values for a new root-finding iterative method, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Computation of approximate polynomial GCDs and an extension, Finding a cluster of zeros of univariate polynomials, Real computations with fake numbers, On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem, A numerical realization of the conditions of Max Nöther's residual intersection theorem, Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders, On the convergence of Halley's method for multiple polynomial zeros, Coefficient-free adaptations of polynomial root-finders, On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
Uses Software
