Solving a Polynomial Equation: Some History and Recent Progress
From MaRDI portal
complex polynomial zeroscomputer algebradivide-and-conquer algorithmshistorical surveypolynomial equationWeyl's quadtree algorithm
History and biography (01-XX) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) History of numerical analysis (65-03) 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) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
- An adaptive subdivision method for root finding of univariate polynomials
- 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.
- Enclosing all zeros of a system of analytic functions
- Real root polynomials and real root preserving transformations
- On the determination of the number of positive and negative polynomial zeros and their isolation
- Computational aspects of the general Rodrigues problem
- Solution of polynomial equations
- Characterization of local optima of polynomial modulus over a disc
- Fast algorithms for solving the inverse scattering problem for the Zakharov-Shabat system of equations and their applications
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- Real forms of the complex Neumann system: a method for finding real roots of polynomial \(U_{\mathcal{S}} ( \lambda )\)
- Exponential bounds for intensity of jumps
- Fitting C^2 continuous parametric surfaces to frontiers delimiting physiologic structures
- A note on the finite variance of the averaging function for polynomial system solving
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
- 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
- A numerical realization of the conditions of Max Nöther's residual intersection theorem
- On the convergence of Halley's method for multiple polynomial zeros
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- 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
- Algorithms for quaternion polynomial root-finding
- On the complexity of the Descartes method when using approximate arithmetic
- 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
- On the convergence of Chebyshev's method for multiple polynomial zeros
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- Matrix exponentials, \(\mathrm{SU}(N)\) group elements, and real polynomial roots
- On the stability of computing polynomial roots via confederate linearizations
- Deterministic root finding over finite fields using Graeffe transforms
- The Complexity of Solving Polynomial Equations by Quadrature
- Finding the number of roots of a polynomial in a plane region using the winding number
- Electromagnetic field generated by a modulated moving point source in a planarly layered waveguide
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
- General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
- Improved bounds for the CF algorithm
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- A fitting algorithm for real coefficient polynomial rooting
- A geometric algorithm for winding number computation with complexity analysis
- scientific article; zbMATH DE number 1278170 (Why is no real title available?)
- The computation of multiple roots of a polynomial
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- scientific article; zbMATH DE number 1555915 (Why is no real title available?)
- Calibrating the Black-Derman-Toy model: some theoretical results
- Geometry of polynomials and root-finding via path-lifting
- 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
- Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method
- Overdetermined Weierstrass iteration and the nearest consistent system
- Factoring multivariate polynomials via partial differential equations
- scientific article; zbMATH DE number 1894935 (Why is no real title available?)
- Root refinement for real polynomials using quadratic interval refinement
- Computing real roots of real polynomials
- Newton's method and the computational complexity of the fundamental theorem of algebra
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- Polynomials, dynamics, and choice. The price we pay for symmetry
- The Weierstrass–Durand–Kerner root finder is not generally convergent
- Routh-type table test for zero distribution of polynomials with commensurate fractional and integer degrees
- Newton-ellipsoid polynomiography
- Effective numerical method of spectral analysis of quantum graphs
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- A CMV-Based Eigensolver for Companion Matrices
- New progress in real and complex polynomial root-finding
- 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
- Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
- Validated Root Enclosures for Interval Polynomials with Multiplicities
This page was built for publication: Solving a Polynomial Equation: Some History and Recent Progress
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340817)
