RegularChains
From MaRDI portal
Software:13544
swMATH796MaRDI QIDQ13544FDOQ13544
Author name not available (Why is that?)
Cited In (87)
- Comprehensive Triangular Decomposition
- Doing algebraic geometry with the RegularChains library
- Computing strong regular characteristic pairs with Gröbner bases
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- Thomas decomposition of algebraic and differential systems
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- Thomas decomposition and nonlinear control systems
- Computational schemes for subresultant chains
- Change of order for regular chains in positive dimension
- On the mechanization of straightedge and compass constructions
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
- Real root isolation of regular chains
- Using machine learning to improve cylindrical algebraic decomposition
- Algorithms for computing triangular decompositions of polynomial systems
- A package for parametric matrix computations
- Algorithms for computing triangular decomposition of polynomial systems
- Truth table invariant cylindrical algebraic decomposition by regular chains
- The Gröbner cover
- Cylindrical algebraic decomposition with equational constraints
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Complexity of triangular representations of algebraic sets
- MABSys: Modeling and analysis of biological systems
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Algorithmic Thomas decomposition of algebraic and differential systems
- The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Computing the canonical representation of constructible sets
- The complexity of cylindrical algebraic decomposition with respect to polynomial degree
- Real quantifier elimination in the RegularChains library
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries
- On approximate linearized triangular decompositions
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Fully incremental cylindrical algebraic decomposition
- On approximate triangular decompositions in dimension zero
- Triangular decomposition of semi-algebraic systems
- Intersection formulas and algorithms for computing triangular decompositions
- Solving via modular methods
- 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
- Change of ordering for regular chains in positive dimension
- Formal algorithmic elimination for PDEs
- Discovering polynomial Lyapunov functions for continuous dynamical systems
- Gröbner bases for polynomial systems with parameters
- Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Computing images of polynomial maps
- Formal algorithmic elimination for PDEs
- Open weak CAD and its applications
- Computing limits with the regularchains and powerseries libraries
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Computer theorem proving for verifiable solving of geometric construction problems
- Algebraic transformation of differential characteristic decompositions from one ranking to another
- Truth table invariant cylindrical algebraic decomposition
- Computations modulo regular chains
- Model reduction of chemical reaction systems using elimination
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- What does ``without loss of generality mean, and how do we detect it
- Real root isolation of regular chains
- Dynamics of a density-dependent stage-structured predator-prey system with Beddington-DeAngelis functional response
- Using the Regular Chains library to build cylindrical algebraic decompositions by projecting and lifting
- A method for semi-rectifying algebraic and differential systems using scaling type Lie point symmetries with linear algebra
- Cylindrical algebraic decomposition in the RegularChains library
- Solving parametric polynomial systems by RealComprehensiveTriangularize
- Parallelization of triangular decompositions: techniques and implementation
- Subresultant chains using Bézout matrices
- Fast arithmetic for triangular sets: from theory to practice
- Chordal networks of polynomial ideals
- Characterizations and criteria for synchronization of heterogeneous networks to linear subspaces
- On parametric linear system solving
- On the uniqueness problem for quadrature domains
- Qualitative investigation of a gene model using computer algebra algorithms
- Comprehensive LU Factors of Polynomial Matrices
- Jordan canonical form with parameters from Frobenius form with parameters
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
- Title not available (Why is that?)
- Size of coefficients of lexicographical Gröbner bases: the zero-dimensional, radical and bivariate case
- Curtains in CAD: Why Are They a Problem and How Do We Fix Them?
- Computing the real solutions of polynomial systems with the RegularChains library in Maple
- Study of \(D\)-decompositions by the methods of computational real-valued algebraic geometry
- On types of degenerate critical points of real polynomial functions
- Mathematical software -- ICMS 2014. 4th international congress, Seoul, South Korea, August 5--9, 2014. Proceedings
- Using Maple's RegularChains library to automatically classify plane geometric loci
- Recognition of concurrency relations between inaccurate lines
- Verifiable conditions on asymptotic stabilisability for a class of planar switched linear systems
- Hierarchical Comprehensive Triangular Decomposition
This page was built for software: RegularChains
