Regular semi-algebraic system

Known as: Regular 
In computer algebra, a regular semi-algebraic system is a particular kind of triangular system of multivariate polynomials over a real closed field.
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2017
0246819802017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A new projection operator based on cylindrical algebraic decomposition (CAD) is proposed. The new operator computes the… (More)
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In view of the minimization of a nonsmooth nonconvex function f , we prove an abstract convergence result for descent methods… (More)
Is this relevant?
2010
2010
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of… (More)
  • table 1
Is this relevant?
2006
2006
In this paper we deal with the problem of computing Lyapunov functions for stability verification of differential systems. We… (More)
Is this relevant?
2006
2006
This chapter presents an approach for texture and object recognition that uses scaleor affine-invariant local image features in… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2005
2005
with φ a C∞ function with compact support in Ω. Note that Qu corresponds to the second variation of the energy associated to (1… (More)
Is this relevant?
2003
2003
~n this paper, a semi-analytic method is presented to describe symmetrical lossless networks with two-kinds of elements, namely… (More)
  • figure I
  • figure 3
Is this relevant?
1997
1997
The solution of the Dirichlet problem relative to an elliptic system in a polyhedron has a complex singular behaviour near edges… (More)
Is this relevant?
1997
1997
In this paper, we study abelian varieties of dimension 4 over number fields with the property that the Lie algebra of their… (More)
  • table 1.4
  • table 4.3
  • table 4.4
  • table 4.13
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Recall that a subset of R is called semi-algebraic if it can be represented as a (finite) boolean combination of sets of the form… (More)
Is this relevant?