RAGlib

swMATH774MaRDI QIDQ13522FDOQ13522

Author name not available (Why is that?)

Cited In (68)

• A probabilistic algorithm for computing data-discriminants of likelihood equations
• Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets
• The “Seven Dwarfs” of Symbolic Computation
• Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
• Algebraic systems biology: a case study for the Wnt pathway
• Symbolic computation in hyperbolic programming
• Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities
• A concise proof of the Kronecker polynomial system solver from scratch
• Degeneracy loci and polynomial equation solving
• Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
• A note on optimization with Morse polynomials
• Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space
• Reaching generalized critical values of a polynomial
• Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
• Certified non-conservative tests for the structural stability of discrete multidimensional systems
• Solving parametric systems of polynomial equations over the reals through Hermite matrices
• Algorithms in real algebraic geometry
• Algorithms in real algebraic geometry
• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
• Triangulations of Line Segment Sets in the Plane
• Determining a rotation of a tetrahedron from a projection
• Properness defects of projection and minimal discriminant variety
• Characterizing positively invariant sets: inductive and topological methods
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• On the intrinsic complexity of point finding in real singular hypersurfaces
• Proving inequalities and solving global optimization problems via simplified CAD projection
• Computing rational solutions of linear matrix inequalities
• On exact Reznick, Hilbert-Artin and Putinar's representations
• On the geometry of polar varieties
• Rational univariate reduction via toric resultants
• Solving parametric piecewise polynomial systems
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
• Related solutions to the perspective three-point pose problem
• On the determination of cusp points of 3-RPR parallel manipulators
• An algorithm for finding repeated solutions to the general perspective three-point pose problem
• The hierarchy of local minimums in polynomial optimization
• Algebraic and symbolic computation methods in dynamical systems. Based on articles written for the invited sessions of the 5th symposium on system structure and control, IFAC, Grenoble, France, February 4--6, 2013 and of the 21st international symposium on mathematical theory of networks and systems (MTNS 2014), Groningen, the Netherlands, July 7--11, 2014
• Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
• The Voronoi diagram of three lines
• Asymptotics of bivariate analytic functions with algebraic singularities
• Real root finding for determinants of linear matrices
• Border basis relaxation for polynomial optimization
• Algebra and Geometry in the Study of Enzymatic Cascades
• Toward effective detection of the bifurcation locus of real polynomial maps
• Computing real radicals and \(S\)-radicals of polynomial systems
• Testing sign conditions on a multivariate polynomial and applications
• Detecting bifurcation values at infinity of real polynomials
• Sweeping algebraic curves for singular solutions
• Variant real quantifier elimination: algorithm and application
• Exact algorithms for linear matrix inequalities
• Real quantifier elimination by computation of comprehensive Gröbner systems
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• Computing real witness points of positive dimensional polynomial systems
• Thirty years of polynomial system solving, and now?
• A fundamentally new view of the perspective three-point pose problem
• Solving parametric polynomial systems
• Real root finding for low rank linear matrices
• The Voronoi diagram of three lines
• On the Generation of Positivstellensatz Witnesses in Degenerate Cases
• Intrinsic complexity estimates in polynomial optimization
• Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
• A systematic approach for doing an a priori identifiability study of dynamical nonlinear models
• Computing the global optimum of a multivariate polynomial over the reals
• Title not available (Why is that?)
• Coercive Polynomials and Their Newton Polytopes
• Directing Functionals and De Branges Space Completions in Almost Pontryagin Spaces
• Variant quantifier elimination

This page was built for software: RAGlib