Relations between roots and coefficients, interpolation and application to system solving
From MaRDI portal
Publication:697492
DOI10.1006/jsco.2002.0530zbMath1022.13007OpenAlexW2023099904MaRDI QIDQ697492
Olivier Ruatta, Mourrain, Bernard
Publication date: 17 September 2002
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/99f8872e5a79de559981ca156c4613e1420b4622
numerical continuationelementary symmetric functionsapproximation of roots of system of polynomial equationssystem solving
Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Complexity results for triangular sets, On Multivariate Interpolation, Overdetermined Weierstrass iteration and the nearest consistent system, Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks, Stable border bases for ideals of points, Nearest multivariate system with given root multiplicities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical computation of polynomial zeros by means of Aberth's method
- A unified approach to method for the simultaneous computation of all zeros of generalized polynomials
- Some lower bounds for the complexity of continuation methods
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
- Isolated points, duality and residues
- Finding a cluster of zeros of univariate polynomials
- Multivariate polynomials, duality, and structured matrices
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- On multivariate polynomial interpolation
- Bivariate Hermite interpolation and applications to algebraic geometry
- Polynomial root finding using iterated Eigenvalue computation
- A multivariate Weierstrass iterative rootfinder
- Solving projective complete intersection faster
- Géométrie des points épais
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Solving a Polynomial Equation: Some History and Recent Progress
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
