RegularChains

The RegularChains package in the computer algebra software package Maple is a collection of commands for solving systems of polynomial equations…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

The work presented here is motivated by our ongoing project on symbolic bifurcation analysis of multidimensional germs of…

2018

Algorithms which compute modulo triangular sets must respect the presence of zero-divisors. We present Hensel lifting as a tool…

2016

Termination of linear loop programs has received extensive attention in these years. In this paper, we focus on the termination…

2015

Given a regular chain, we are interested in questions like computing the limit points of its quasi-component, or equivalently…

2014

Quantifier elimination (QE) over real closed fields has found numerous applications. Cylindrical algebraic decomposition (CAD) is…

2014

Motivated by the problem of determining the Jordan and Weyr canonical forms of parametric matrices, we present a Maple package…

2013

There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple's library RegularChains…

2011

A new concept, decomposition-unstable (DU) variety of a parametric polynomial system, is introduced in this paper and the…

2010

Methods for computing triangular decompositions of polynomial systems can be classified into two groups. First, those computing a…