Jump to content

Triangular decomposition

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by M.Moreno-Maza (talk | contribs) at 14:48, 23 October 2010 (←Created page with 'In computer algebra, a '''triangular decomposition''' of a polynomial system <math>S</math> a list of simpler systems <math>S_1,\ldots, S_n</math> such that a p...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computer algebra, a triangular decomposition of a polynomial system $S$ a list of simpler systems $S_{1},\ldots ,S_{n}$ such that a point is a solution of $S$ if and only if it is a solution of one of the systems $S_{1},\ldots ,S_{n}$ .

Retrieved from "https://en.wikipedia.org/w/index.php?title=Triangular_decomposition&oldid=392411913"