Nearest multivariate system with given root multiplicities

DOI10.1016/j.jsc.2008.03.005zbMath1168.65347OpenAlexW2154155820MaRDI QIDQ1015156

Agnes Szanto, Scott R. Pope

Publication date: 7 May 2009

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.03.005

zbMATH Keywords

multiple rootsmultiplicity structureapproximate polynomial systemsWeierstrass iteration

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Solving polynomial systems; resultants (13P15)

Related Items

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, On deflation and multiplicity structure, Computing the nearest singular univariate polynomials with given root multiplicities, Computing the multiplicity structure of an isolated singular solution: case of breadth one, Overdetermined Weierstrass iteration and the nearest consistent system, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, A unified approach to computing the nearest complex polynomial with a given zero, Accurate solution of near-colliding Prony systems via decimation and homotopy continuation

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
• Modified deflation algorithm for the solution of singular problems. II: Nonlinear multipoint boundary value problems
• Deflation algorithm for the multiple roots of a system of nonlinear equations
• Relations between roots and coefficients, interpolation and application to system solving
• On location and approximation of clusters of zeros: Case of embedding dimension one
• Computing singular solutions to polynomial systems
• On approximate GCDs of univariate polynomials
• Nearest singular polynomials
• Isolated points, duality and residues
• Detection and validation of clusters of polynomial zeros
• Finding a cluster of zeros of univariate polynomials
• Quadratic Newton iteration for systems with multiplicity
• On multivariate Hermite interpolation
• H-bases for polynomial interpolation and system solving
• Approximate radical for clusters: A global approach using Gaussian elimination or SVD
• Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
• Newton's method with deflation for isolated singularities of polynomial systems
• On location and approximation of clusters of zeros of analytic functions
• A multivariate Weierstrass iterative rootfinder
• Approximate radical of ideals with clusters of roots
• Computing multiple roots of inexact polynomials
• Numerical Polynomial Algebra
• Newton's method for overdetermined systems of equations
• Computing the multiplicity structure in solving polynomial systems
• Computing the multiplicity structure from geometric involutive form