Triangular decomposition
id:
triangular-decomposition-282-7434800
title:
Triangular decomposition
text:
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 solution of S if and only if it is a solution of one of the systems S1, ..., Se. When the purpose is to describe the solution set of S in the algebraic closure of its coefficient field, those simpler systems are regular chains. If the coefficients of the polynomial systems S1, ..., Se are real numbers, then the real solutions of S can be obtained by a
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm on systems of polynomials
original url:
https://en.wikipedia.org/wiki/Triangular_decomposition
date created:
date modified:
2024-02-12T15:10:08Z
main entity:
{"identifier":"Q7840134","url":"https://www.wikidata.org/entity/Q7840134"}
image:
fields total:
13
integrity:
14