Solving zero-dimensional algebraic systems (Q1190743): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55883678, #quickstatements; #temporary_batch_1706294994303 |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Jun-ichi Nishimura / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jun-ichi Nishimura / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:27, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving zero-dimensional algebraic systems |
scientific article |
Statements
Solving zero-dimensional algebraic systems (English)
0 references
26 September 1992
0 references
Let \(X_ 1,\ldots,X_ n\) be \(n\) variables ordered as \(X_ 1<X_ 2<\cdots<X_ n\). The main variable of a polynomial is the greatest variable in it. A set of \(n\) polynomials is called \textit{triangular} if the main variable of the \(i\)-th polynomial is \(X_ i\) and monic in \(X_ i\). Using this terminology, the author first remarks: Proposition 1. If \(K\) is a field, any maximal ideal in \(K[X_ 1,\ldots,X_ n]\) has a triangular system of generators. Proposition 2. Every system with a finite number of solutions (in an algebraic closure of \(K\)) is equivalent to the union of a finite number of triangular systems. Then he shows how to compute numerically the common zeros of a triangular set.
0 references
triangular set
0 references
compute numerically the common zeros
0 references
Gröbner base
0 references