RegularChains

swMATH796MaRDI QIDQ13544FDOQ13544

Author name not available (Why is that?)

Cited In (87)

• Jordan Canonical Form with Parameters from Frobenius Form with Parameters
• On the uniqueness problem for quadrature domains
• Qualitative investigation of a gene model using computer algebra algorithms
• Verifiable Conditions on Asymptotic Stabilisability for a Class of Planar Switched Linear Systems
• Comprehensive LU Factors of Polynomial Matrices
• 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
• Using Maple’s RegularChains Library to Automatically Classify Plane Geometric Loci
• 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
• Recognition of concurrency relations between inaccurate lines
• Hierarchical Comprehensive Triangular Decomposition
• Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems
• Comprehensive Triangular Decomposition
• 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
• Title not available (Why is that?)
• When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
• 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
• Title not available (Why is that?)
• Using machine learning to improve cylindrical algebraic decomposition
• Algorithms for computing triangular decompositions of polynomial systems
• Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting
• Formal Algorithmic Elimination for PDEs
• Algorithms for computing triangular decomposition of polynomial systems
• A method for semi-rectifying algebraic and differential systems using scaling type lie point symmetries with linear algebra
• The Gröbner cover
• Cylindrical algebraic decomposition with equational constraints
• Cylindrical Algebraic Decomposition in the RegularChains Library
• Solving Parametric Polynomial Systems by RealComprehensiveTriangularize
• Title not available (Why is that?)
• Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
• Complexity of triangular representations of algebraic sets
• Doing Algebraic Geometry with the RegularChains Library
• 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
• Real Root Isolation of Regular Chains
• Computing with semi-algebraic sets: relaxation techniques and effective boundaries
• On exact Reznick, Hilbert-Artin and Putinar's representations
• A Package for Parametric Matrix Computations
• Identifying the parametric occurrence of multiple steady states for some biological networks
• Fully incremental cylindrical algebraic decomposition
• On approximate triangular decompositions in dimension zero
• Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
• Thomas Decomposition of Algebraic and Differential Systems
• Triangular decomposition of semi-algebraic systems
• Characterizations and Criteria for Synchronization of Heterogeneous Networks to Linear Subspaces
• 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
• MABSys: Modeling and Analysis of Biological Systems
• Title not available (Why is that?)
• 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
• The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
• Real Quantifier Elimination in the RegularChains Library
• 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}
• Chordal Networks of Polynomial Ideals
• Algebraic transformation of differential characteristic decompositions from one ranking to another
• Thomas Decomposition and Nonlinear Control Systems
• 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
• Solving via Modular Methods
• What does ``without loss of generality mean, and how do we detect it
• Dynamics of a density-dependent stage-structured predator-prey system with Beddington-DeAngelis functional response
• Parallelization of triangular decompositions: techniques and implementation
• Subresultant chains using Bézout matrices
• Fast arithmetic for triangular sets: from theory to practice
• On parametric linear system solving

This page was built for software: RegularChains