Overdetermined Weierstrass iteration and the nearest consistent system

DOI10.1016/J.TCS.2014.10.008zbMath1310.65044arXiv1401.5086OpenAlexW2055130031WikidataQ57438842 ScholiaQ57438842MaRDI QIDQ476879

Mark Sciabica, Olivier Ruatta, Agnes Szanto

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.5086

zbMATH Keywords

approximate GCDoverdetermined systemsnearest consistent systemWeierstrass-Durand-Kerner method

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Solving polynomial systems; resultants (13P15)

Uses Software

• Unnamed Item
• alphaCertified
• na20

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate GCD of several univariate polynomials with small degree perturbations
• An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• A subdivision method for computing nearest gcd with certification
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
• Relations between roots and coefficients, interpolation and application to system solving
• Hybrid method for computing the nearest singular polynomials
• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• Approximate polynomial GCD: small degree and small height perturbations
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
• Nearest multivariate system with given root multiplicities
• Quasi-gcd computations
• A unified approach to method for the simultaneous computation of all zeros of generalized polynomials
• Solutions of systems of algebraic equations and linear maps on residue class rings
• On approximate GCDs of univariate polynomials
• Nearest singular polynomials
• When are two numerical polynomials relatively prime?
• A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
• Computing the isolated roots by matrix methods
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
• Certified approximate univariate GCDs
• Detection and validation of clusters of polynomial zeros
• Fast algorithms for zero-dimensional polynomial systems using duality
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Computation of approximate polynomial GCDs and an extension
• Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
• Multivariate polynomials, duality, and structured matrices
• Approximate gcds of polynomials and sparse SOS relaxations
• Stable normal forms for polynomial system solving
• The nearest polynomial with a zero in a given domain
• A numerical elimination method for polynomial computations
• Global minimization of rational functions and the nearest GCDs
• Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields
• Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
• A multivariate Weierstrass iterative rootfinder
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Algorithm 921
• Solving a Polynomial Equation: Some History and Recent Progress
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Computing multiple roots of inexact polynomials
• The approximate GCD of inexact polynomials
• Solving algebraic systems using matrix computations
• Numerical Polynomial Algebra
• Newton's method for overdetermined systems of equations
• Generalized normal forms and polynomial system solving
• The nearest polynomial with a given zero, revisited
• Computation of a specified root of a polynomial system of equations using eigenvectors
• Hybrid rational function approximation and its accuracy analysis

This page was built for publication: Overdetermined Weierstrass iteration and the nearest consistent system