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.
2014
2014
We study the PBW filtration on the irreducible highest weight representations of simple complex finite-dimensional Lie algebras… 
2007
2007
In this paper, we describe progress on the development of algorithms for triangular decomposition of approximate systems. 
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… 
2000
2000
This paper identifies a misconception about the algebraic structure underlying the view of transitive closure as a matrix… 
1983
1983
It is shown that the coefficients of linear prediction for a random process and the prediction error variances are related to the… 
1970
1970
SummaryThe number of multiplications required for matrix multiplication, for the triangular decomposition of a matrix with…