Solving polynomial equations. Foundations, algorithms, and applications
From MaRDI portal
Publication:1776342
Symbolic computation and algebraic computation (68W30) Collections of articles of miscellaneous specific interest (00B15) Separable extensions, Galois theory (12F10) Proceedings, conferences, collections, etc. pertaining to algebraic geometry (14-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to commutative algebra (13-06) Computational aspects and applications of commutative rings (13Pxx) Proceedings, conferences, collections, etc. pertaining to field theory (12-06) Computational aspects in algebraic geometry (14Qxx)
Recommendations
- scientific article; zbMATH DE number 1555915
- An Algorithm for Solving Polynomial Equations
- Algorithms for near solutions to polynomial equations
- scientific article; zbMATH DE number 1424365
- Solution of polynomial equations
- Solution of polynomial equations in the field of algebraic numbers
- scientific article; zbMATH DE number 1104296
- scientific article; zbMATH DE number 6403662
- Solving polynomial equations
- scientific article; zbMATH DE number 5270892
Cited in
(65)- On binomial complete intersections
- On Search for All Roots of a System of Quadratic Equations
- On the complexity of Chow and Hurwitz forms
- Sparse discriminants and applications
- Eigenvalue methods for sparse tropical polynomial systems
- Resolution of polynomial systems
- Numerically solving polynomial systems with Bertini
- Clustering complex zeros of triangular systems of polynomials
- Computing PUR of zero-dimensional ideals of breadth at most one
- Conservative relativistic algebrodynamics induced on an implicitly defined world line
- Algebraic algorithms for structure determination in biological chemistry
- Solving a sparse system using linear algebra
- An Algorithm for Solving Polynomial Equations
- Solving equations via algebras
- Parallelization of modular algorithms
- scientific article; zbMATH DE number 1424365 (Why is no real title available?)
- Deterministic normal position transformation and its applications
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- scientific article; zbMATH DE number 1555236 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- Zeros of polynomials and solvable nonlinear evolution equations
- Symbolic-numeric methods for solving polynomial equations and applications
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- Applications of polynomial systems. With contributions by Carlos D'Andrea, Alicia Dickenstein, Jonathan Hauenstein, Hal Schenck, and Jessica Sidman
- Computing isolated roots of sparse polynomial systems in affine space
- Solving polynomial systems via truncated normal forms
- Nonlinear algebra and applications
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- Optimized parametrization of systems of incidences between rigid bodies
- An estimator for the hardness of the MQ problem
- scientific article; zbMATH DE number 54152 (Why is no real title available?)
- Numerical Polynomial Algebra
- Introduction to the solution of polynomial systems
- A multi-phenotypic cancer model with cell plasticity
- From an approximate to an exact absolute polynomial factorization
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Real polynomial iterative roots in the case of nonmonotonicity height \(\geqslant 2\)
- scientific article; zbMATH DE number 1952043 (Why is no real title available?)
- A Poisson formula for the sparse resultant
- Numerical root finding via Cox rings
- The approach of moments for polynomial equations
- Complexity of solving parametric polynomial systems
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- Nonnegative polynomials and sums of squares
- Algebraic geometry and computer vision: Polynomial systems, real and complex roots
- On solving large systems of polynomial equations appearing in discrete differential geometry
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- Linear time algorithm for optimal feed-link placement
- Accurate solution of polynomial equations using Macaulay resultant matrices
- scientific article; zbMATH DE number 2051430 (Why is no real title available?)
- Toric eigenvalue methods for solving sparse polynomial systems
- Exact algorithms for the bottleneck Steiner tree problem
- A stabilized normal form algorithm for generic systems of polynomial equations
- The Canny-Emiris conjecture for the sparse resultant
- Finding all Nash equilibria of a finite game using polynomial algebra
- Solutions to systems of binomial equations
- Computing zero-dimensional tropical varieties via projections
- scientific article; zbMATH DE number 1555915 (Why is no real title available?)
- Novel trend of mixed Minkowski volumes applications
- On the computation of intersection numbers for twisted cocycles
- On computing absolutely irreducible components of algebraic varieties with parameters
Describes a project that uses
Uses Software
This page was built for publication: Solving polynomial equations. Foundations, algorithms, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1776342)
