RegularChains

swMATH796MaRDI QIDQ13544FDOQ13544

Author name not available (Why is that?)

Official website: http://www.regularchains.org/

Described by source

• The RegularChains library in Maple 10

Cited In (only showing first 100 items - show all)

• Doing algebraic geometry with the RegularChains library
• Quantifier elimination by cylindrical algebraic decomposition based on regular chains
• A symbolic-numerical algorithm for isolating real roots of certain radical expressions
• Thomas decomposition and nonlinear control systems
• Computational schemes for subresultant chains
• 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
• A package for parametric matrix computations
• On the uniqueness problem for quadrature domains
• Truth table invariant cylindrical algebraic decomposition by regular chains
• The Gröbner cover
• Qualitative investigation of a gene model using computer algebra algorithms
• 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
• Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
• The complexity of cylindrical algebraic decomposition with respect to polynomial degree
• Real quantifier elimination in the RegularChains library
• Locales
• 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
• Jordan canonical form with parameters from Frobenius form with parameters
• 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
• Size of coefficients of lexicographical Gröbner bases: the zero-dimensional, radical and bivariate case
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Computing images of polynomial maps
• ZariskiFrames
• 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
• Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
• Recognition of concurrency relations between inaccurate lines
• What does ``without loss of generality mean, and how do we detect it
• DifferentialElimination
• Using the Regular Chains library to build cylindrical algebraic decompositions by projecting and lifting
• Parallelization of triangular decompositions: techniques and implementation
• Subresultant chains using Bézout matrices
• Hierarchical Comprehensive Triangular Decomposition
• Chordal networks of polynomial ideals
• Characterizations and criteria for synchronization of heterogeneous networks to linear subspaces
• On parametric linear system solving
• Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks
• 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?)
• 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
• Verifiable conditions on asymptotic stabilisability for a class of planar switched linear systems
• Comprehensive Triangular Decomposition
• Computing strong regular characteristic pairs with Gröbner bases
• Thomas decomposition of algebraic and differential systems
• When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
• Change of order for regular chains in positive dimension
• Algorithms for computing triangular decompositions of polynomial systems
• Algorithms for computing triangular decomposition of polynomial systems
• Algorithmic Thomas decomposition of algebraic and differential systems
• The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
• Computing the canonical representation of constructible sets
• Computing with semi-algebraic sets: relaxation techniques and effective boundaries
• On approximate linearized triangular decompositions
• Intersection formulas and algorithms for computing triangular decompositions
• Solving via modular methods
• Dagwood
• Epsilon
• Ginv
• Kronecker
• Maple
• MetiTarski
• QEPCAD
• REDLOG
• SymbolicData
• OreModules
• Maplet
• modpn
• SqFreeEVAL
• Formal algorithmic elimination for PDEs
• DISCOVERER
• Janet
• SgpDec
• BPAS
• CUMODP
• BLAD
• DifferentialThomas
• DIFFALG
• Paramotopy
• Jets
• IFSGen4LaTeX
• grobcov.lib
• ProjectionCAD
• control.lib
• Wsolve

This page was built for software: RegularChains