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_4zbMATH Open1166.65317OpenAlexW1949099970MaRDI QIDQ3597979FDOQ3597979
Authors: Mohab Safey El Din 
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
Recommendations
- On the generalized critical values of a polynomial mapping
- Reaching generalized critical values of a polynomial
- On asymptotic critical values of a complex polynomial
- Computing the global optimum of a multivariate polynomial over the reals
- Critical point computations on smooth varieties, degree and complexity bounds
Cites Work
- Efficient isolation of polynomial's real roots.
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- Solving zero-dimensional systems through the rational univariate representation
- Straight-line programs in geometric elimination theory
- Computing parametric geometric resolutions
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- A Gröbner free alternative for polynomial system solving
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Title not available (Why is that?)
- Solving parametric polynomial systems
- Solving systems of polynomial inequalities in subexponential time
- Title not available (Why is that?)
- A delineability-based method for computing critical sets of algebraic surfaces
- Testing sign conditions on a multivariate polynomial and applications
- Generalized polar varieties and an efficient real elimination.
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Semialgebraic Sard theorem for generalized critical values.
- On asymptotic critical values of a complex polynomial
- Automated Deduction in Geometry
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- The Voronoi diagram of three lines
- On sums of squares
- Quantifier elimination: Optimal solution for two classical examples
Cited In (11)
- Reaching generalized critical values of a polynomial
- Critical points and Gröbner bases: the unmixed case
- Critical point computations on smooth varieties, degree and complexity bounds
- Quantitative generalized Bertini-Sard theorem for smooth affine varieties
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- The Voronoi diagram of three lines
- Testing sign conditions on a multivariate polynomial and applications
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Stability analysis of a bacterial growth model through computer algebra
- Intrinsic complexity estimates in polynomial optimization
- Thom isotopy theorem for nonproper maps and computation of sets of stratified generalized critical values
Uses Software
This page was built for publication: Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597979)
