Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
From MaRDI portal
Publication:3597979
DOI10.1007/978-3-540-87827-8_4zbMath1166.65317OpenAlexW1949099970MaRDI QIDQ3597979
Publication date: 29 January 2009
Published in: Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_4
Related Items (6)
Reaching generalized critical values of a polynomial ⋮ Stability analysis of a bacterial growth model through computer algebra ⋮ Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients ⋮ Intrinsic complexity estimates in polynomial optimization ⋮ Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping ⋮ The Voronoi diagram of three lines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Quantifier elimination: Optimal solution for two classical examples
- Solving systems of polynomial inequalities in subexponential time
- Solving zero-dimensional systems through the rational univariate representation
- Straight-line programs in geometric elimination theory
- Efficient isolation of polynomial's real roots.
- Computing parametric geometric resolutions
- Semialgebraic Sard theorem for generalized critical values.
- Solving parametric polynomial systems
- A delineability-based method for computing critical sets of algebraic surfaces
- Testing sign conditions on a multivariate polynomial and applications
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- On asymptotic critical values of a complex polynomial
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Automated Deduction in Geometry
- On sums of squares
- Algorithms in real algebraic geometry
- A Gröbner free alternative for polynomial system solving
This page was built for publication: Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
