Skip to search formSkip to main contentSkip to account menu

Triangular decomposition

In computer algebra, a triangular decomposition of a polynomial system S is a set of simpler polynomial systems S1, ..., Se such that a point is a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In the process of reverse engineering, the most important and most complex step is the reconstruction of the three-dimensional… 
2013
2013
For pricing American options using Heston's stochastic volatility model, center difference schemes and alternative direction… 
2007
2007
We present an explicit character formula for the irreducible highest weight representations of the non-twisted affine Kac-Moody… 
2006
2006
We propose a method to decompose any strict preference relation P (that is any asymmetric relation) defined on a set A in view of… 
2004
2004
Let F be a field of characteristic 0, L be any Lie algebra with a triangular decomposition over F and L be the corresponding loop… 
Review
2004
Review
2004
Representations of quantum operations We start by introducing a geometrical representation (real vector space) of quantum states… 
2000
2000
This paper identifies a misconception about the algebraic structure underlying the view of transitive closure as a matrix… 
Review
1999
Review
1999
This paper describes triangular risk decomposition, which provides a useful, geometric view of the relationship between the risk…