Relations between roots and coefficients, interpolation and application to system solving
From MaRDI portal
(Redirected from Publication:697492)
Recommendations
- scientific article; zbMATH DE number 5270892
- Determination of the basis of the space of all root functionals of a system of polynomial equations and of the basis of its ideal by the operation of the extension of bounded root functionals
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD
- Using symmetries in the eigenvalue method for polynomial systems
- On using symmetric polynomials for constructing root finding methods
- Separation of the maximum isolated 0-dimensional component of the manifold of roots
- Algebraic computation of resolvents without extraneous powers
- Numerical algorithms for dual bases of positive-dimensional ideals
- scientific article; zbMATH DE number 1263357
- A multivariate Weierstrass iterative rootfinder
Cites work
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 1069617 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A multivariate Weierstrass iterative rootfinder
- A new efficient algorithm for computing Gröbner bases (F₄)
- A unified approach to method for the simultaneous computation of all zeros of generalized polynomials
- Bivariate Hermite interpolation and applications to algebraic geometry
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Finding a cluster of zeros of univariate polynomials
- Géométrie des points épais
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Isolated points, duality and residues
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Multivariate polynomials, duality, and structured matrices
- Numerical computation of polynomial zeros by means of Aberth's method
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On multivariate polynomial interpolation
- Polynomial root finding using iterated eigenvalue computation
- Solving a Polynomial Equation: Some History and Recent Progress
- Solving projective complete intersection faster
- Some lower bounds for the complexity of continuation methods
Cited in
(8)- Complexity results for triangular sets
- On Multivariate Interpolation
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- An extension of elementary symmetric polynomials and power sums to the case of multivariate polynomials
- Nearest multivariate system with given root multiplicities
- scientific article; zbMATH DE number 2219554 (Why is no real title available?)
- Overdetermined Weierstrass iteration and the nearest consistent system
- Stable border bases for ideals of points
This page was built for publication: Relations between roots and coefficients, interpolation and application to system solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697492)
