Solving polynomial equations. Foundations, algorithms, and applications
DOI10.1007/B138957zbMATH Open1061.12001OpenAlexW2497281012MaRDI QIDQ1776342FDOQ1776342
Authors:
Publication date: 12 May 2005
Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b138957
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
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)
Cited In (62)
- Sparse discriminants and applications
- Eigenvalue methods for sparse tropical polynomial systems
- On binomial complete intersections
- On the complexity of Chow and Hurwitz forms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Title not available (Why is that?)
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- Nonnegative polynomials and sums of squares
- Toric eigenvalue methods for solving sparse polynomial systems
- Computing isolated roots of sparse polynomial systems in affine space
- Numerical Polynomial Algebra
- Algebraic geometry and computer vision: Polynomial systems, real and complex roots
- Title not available (Why is that?)
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- Deterministic normal position transformation and its applications
- Solving Polynomial Systems via Truncated Normal Forms
- Computing PUR of zero-dimensional ideals of breadth at most one
- Clustering complex zeros of triangular systems of polynomials
- Title not available (Why is that?)
- Symbolic-numeric methods for solving polynomial equations and applications
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Introduction to the solution of polynomial systems
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- A Poisson formula for the sparse resultant
- A stabilized normal form algorithm for generic systems of polynomial equations
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Parallelization of modular algorithms
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- Computing zero-dimensional tropical varieties via projections
- An Algorithm for Solving Polynomial Equations
- On computing absolutely irreducible components of algebraic varieties with parameters
- Nonlinear algebra and applications
- Complexity of solving parametric polynomial systems
- On the computation of intersection numbers for twisted cocycles
- Resolution of polynomial systems
- Solving equations via algebras
- Numerically solving polynomial systems with Bertini
- Numerical root finding via Cox rings
- Linear time algorithm for optimal feed-link placement
- On Search for All Roots of a System of Quadratic Equations
- Title not available (Why is that?)
- Real polynomial iterative roots in the case of nonmonotonicity height \(\geqslant 2\)
- Title not available (Why is that?)
- The approach of moments for polynomial equations
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- The Canny-Emiris conjecture for the sparse resultant
- Solving a sparse system using linear algebra
- From an approximate to an exact absolute polynomial factorization
- Algebraic algorithms for structure determination in biological chemistry
- An estimator for the hardness of the MQ problem
- Exact algorithms for the bottleneck Steiner tree problem
- Optimized parametrization of systems of incidences between rigid bodies
- Conservative relativistic algebrodynamics induced on an implicitly defined world line
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- A multi-phenotypic cancer model with cell plasticity
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Finding all Nash equilibria of a finite game using polynomial algebra
- On solving large systems of polynomial equations appearing in discrete differential geometry
- Accurate solution of polynomial equations using Macaulay resultant matrices
- Novel trend of mixed Minkowski volumes applications
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)
