Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,346,477 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Elimination theory
Regular chain
Regular semi-algebraic system
RegularChains
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Product Form InnovationMethod Based on 3D Morphing for Industrial Designer
Chunfa Sha
2017
Corpus ID: 114477429
3D morphing methods can create many new shapes that merge characteristics of the two given models. These new shapes could be used…
Expand
2012
2012
Hardware Acceleration for Load Flow Computation
Jeremy R. Johnson
,
C. Nwankpa
,
Prawat Nagvajara
,
Kevin Cunningham
,
T. Chagnon
,
Petya Vachranukunkiet
2012
Corpus ID: 62339190
2007
2007
Characters of representations of affine Kac-Moody Lie algebras at the critical level
T. Arakawa
2007
Corpus ID: 15683115
We present an explicit character formula for the irreducible highest weight representations of the non-twisted affine Kac-Moody…
Expand
2006
2006
A block decomposition method to pre-process a strict preference relation
A. Fiordaliso
,
Claude Lamboray
,
M. Pirlot
2006
Corpus ID: 15566558
We propose a method to decompose any strict preference relation P (that is any asymmetric relation) defined on a set A in view of…
Expand
2004
2004
Evaluation Modules of Lie Algebras With a Triangular Decomposition
Xian-Dong Wang
2004
Corpus ID: 123689106
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…
Expand
2003
2003
On an efficient model for gas and fluid supported membrane and shell structures
T. Rumpel
,
K. Schweizerhof
,
Michael Gebhardt
2003
Corpus ID: 5740926
2000
2000
The Algebraic Structure of Transitive Closure and its Application to Attributed Type Signatures
Gerald Penn
Grammars
2000
Corpus ID: 21262491
This paper identifies a misconception about the algebraic structure underlying the view of transitive closure as a matrix…
Expand
2000
2000
Incomplete Block Triangular Decompositions of Order l
A. Buzdin
,
D. Logashenko
Computing
2000
Corpus ID: 26686849
Abstract In this paper, we present a special technique for improving the robustness of block triangular decompositions, for…
Expand
Review
1999
Review
1999
Beyond VaR : Triangular Risk Decomposition
Helmut E. Mausser
,
D. Rosen
1999
Corpus ID: 9758675
This paper describes triangular risk decomposition, which provides a useful, geometric view of the relationship between the risk…
Expand
1972
1972
Technical Note - Generalized Upper Bounds and Triangular Decomposition in the Simplex Method
J. Tomlin
Operational Research
1972
Corpus ID: 37808058
Abstract : Two recent advances in linear programming have been the very successful implementation of the Generalized Upper Bound…
Expand