Computing multiple roots of inexact polynomials

DOI10.1090/S0025-5718-04-01692-8zbMath1079.12007MaRDI QIDQ4654026

Zhonggang Zeng

Publication date: 1 March 2005

Published in: Mathematics of Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ On deflation and multiplicity structure ⋮ A heuristic method for certifying isolated zeros of polynomial systems ⋮ Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations ⋮ Computing the nearest singular univariate polynomials with given root multiplicities ⋮ The calculation of the degree of an approximate greatest common divisor of two polynomials ⋮ Duality of multiple root loci ⋮ Validated Root Enclosures for Interval Polynomials with Multiplicities ⋮ Computational approach to compact Riemann surfaces ⋮ Polynomial GCD derived through monic polynomial subtractions ⋮ The computation of multiple roots of a polynomial ⋮ Determining the multiplicity of a root of a nonlinear algebraic equation ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Algebraic Curves and Riemann Surfaces in Matlab ⋮ A new deflation method for verifying the isolated singular zeros of polynomial systems ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ RankRev: a Matlab package for computing the numerical rank and updating/downdating ⋮ The numerical factorization of polynomials ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Numerical computation of the genus of an irreducible curve within an algebraic set ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials ⋮ Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients ⋮ A study of accelerated Newton methods for multiple polynomial roots ⋮ Computational approach to hyperelliptic Riemann surfaces ⋮ Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations ⋮ A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ A unified approach to resultant matrices for Bernstein basis polynomials ⋮ An improved Toeplitz algorithm for polynomial matrix null-space computation ⋮ An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Nearest multivariate system with given root multiplicities ⋮ An adaptive homotopy method for computing bifurcations of nonlinear parametric systems ⋮ A new higher-order optimal derivative free scheme for multiple roots ⋮ Multiple zeros of nonlinear systems ⋮ Efficient computation of the branching structure of an algebraic curve ⋮ Computing singular points of projective plane algebraic curves by homotopy continuation methods ⋮ The numerical Jordan form ⋮ A numerical realization of the conditions of Max Nöther's residual intersection theorem

Uses Software

• MultRoot
• Eigensolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• Locating multiple zeros interactively
• On condition numbers and the distance to the nearest ill-posed problem
• Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
• On approximate GCDs of univariate polynomials
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Certified approximate univariate GCDs
• Detection and validation of clusters of polynomial zeros
• Iterative methods for multiple zeros of a polynomial by clustering
• Polynomial roots: The ultimate answer?
• Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
• An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros
• Computing the zeros of analytic functions
• Finding a Multiple Zero by Transformations and Newton-Like Methods
• General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗
• Principles for Testing Polynomial Zerofinding Programs
• An algorithm for the total, or partial, factorization of a polynomial
• A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part II: A Stratification-Enhanced Staircase Algorithm
• A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
• Solving a Polynomial Equation: Some History and Recent Progress
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
• A Fortran 90-based multiprecision system
• Numerical impluimentation of a new algorithm for polynomials with multiple roots
• Newton's method for overdetermined systems of equations
• Algorithm 835
• Condition numbers of a nearly singular simple root of a polynomial