Solving polynomial equations. Foundations, algorithms, and applications

DOI10.1007/b138957zbMath1061.12001OpenAlexW2497281012MaRDI QIDQ1776342

No author found.

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Separable extensions, Galois theory (12F10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to algebraic geometry (14-06) Proceedings, conferences, collections, etc. pertaining to field theory (12-06) Proceedings, conferences, collections, etc. pertaining to commutative algebra (13-06) Computational aspects in algebraic geometry (14Qxx) Computational aspects and applications of commutative rings (13Pxx)

Related Items

Computing PUR of zero-dimensional ideals of breadth at most one ⋮ Nonnegative polynomials and sums of squares ⋮ Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization ⋮ A stabilized normal form algorithm for generic systems of polynomial equations ⋮ On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant ⋮ Finding all Nash equilibria of a finite game using polynomial algebra ⋮ Computing zero-dimensional tropical varieties via projections ⋮ Numerical root finding via Cox rings ⋮ Toric eigenvalue methods for solving sparse polynomial systems ⋮ A multi-phenotypic cancer model with cell plasticity ⋮ Real polynomial iterative roots in the case of nonmonotonicity height \(\geqslant 2\) ⋮ The Canny-Emiris conjecture for the sparse resultant ⋮ An estimator for the hardness of the MQ problem ⋮ Parallelization of modular algorithms ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Exact algorithms for the bottleneck Steiner tree problem ⋮ Linear time algorithm for optimal feed-link placement ⋮ From an approximate to an exact absolute polynomial factorization ⋮ Solving a sparse system using linear algebra ⋮ Algebraic algorithms for structure determination in biological chemistry ⋮ Complexity of solving parametric polynomial systems ⋮ Deterministic normal position transformation and its applications ⋮ Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants ⋮ Optimized parametrization of systems of incidences between rigid bodies ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ Clustering complex zeros of triangular systems of polynomials ⋮ The Approach of Moments for Polynomial Equations ⋮ Novel trend of mixed Minkowski volumes applications ⋮ Conservative relativistic algebrodynamics induced on an implicitly defined world line ⋮ Practical complexities of probabilistic algorithms for solving Boolean polynomial systems ⋮ A prolongation-projection algorithm for computing the finite real variety of an ideal ⋮ Semidefinite characterization and computation of zero-dimensional real radical ideals ⋮ Rayleigh quotient methods for estimating common roots of noisy univariate polynomials ⋮ A Poisson formula for the sparse resultant ⋮ On the computation of intersection numbers for twisted cocycles

Uses Software

This page was built for publication: Solving polynomial equations. Foundations, algorithms, and applications