Triangular decomposition of semi-algebraic systems
Triangular decompositions of systems of polynomial equations produce as outputs \textit{regular chains.} The paper under review introduces the notion of \textit{regular semi-algebraic systems}, which should be regarded as the real (i.e., over \({\mathbb R}\)) counterpart of these regular chains. Two notions of a decomposition of a semi-algebraic system are then defined: one called \textit{lazy} where the analysis of components of strictly smaller dimension is deferred, and another called \textit{full} including all the cases. The authors provide running time estimates for computing these decompositions, and their implementations and experimental results are described at the end of the paper.
- Triangular decomposition of semi-algebraic systems
- Computing with semi-algebraic sets represented by triangular decomposition
- Algorithms for computing triangular decomposition of polynomial systems
- Algorithms for computing triangular decompositions of polynomial systems
- scientific article; zbMATH DE number 1979251
- Trinity algebra and its application to machine decompositions
- Computing triangular systems and regular systems
- Specifications for triangulation algorithms of elementary-algebraic systems
- Ritt-Wu characteristic set method for Laurent partial differential polynomial systems
- Elimination theory in differential and difference algebra
- Smooth points on semi-algebraic sets
- Computing real radicals and S-radicals of polynomial systems
- Visualizing planar and space implicit real algebraic curves with singularities
- Identifying the parametric occurrence of multiple steady states for some biological networks
- On the extended Hensel construction and its application to the computation of real limit points
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Special algorithm for stability analysis of multistable biological regulatory systems
- Computing real witness points of positive dimensional polynomial systems
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- The center problem and time-reversibility with respect to a quadratic involution for a class of polynomial differential systems with order 2 or 3
- Solving parametric polynomial systems by RealComprehensiveTriangularize
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- Chordality preserving incremental triangular decomposition and its implementation
- Computing with semi-algebraic sets represented by triangular decomposition
- Algorithms for computing triangular decompositions of polynomial systems
- Triangular decomposition of semi-algebraic systems
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Stability and Zero-Hopf Bifurcation Analysis of the Lorenz–Stenflo System Using Symbolic Methods
- Computing real radicals by moment optimization
- Comprehensive characteristic decomposition of parametric polynomial systems
- Computing the dimension of real algebraic sets
- The two-loop amplituhedron
- Solving parameter-dependent semi-algebraic systems
- Algorithmic analysis of Jacobi stability for systems of second order ordinary differential equations
- Exact stability test and stabilization for fractional systems
This page was built for publication: Triangular decomposition of semi-algebraic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917866)
