Algorithms in real algebraic geometry
Algorithms in real algebraic geometry
复制标题
DOI:
10.1007/3-540-33099-2
复制
发表时间:
1988
期刊:
影响因子:
--
通讯作者:
D. S. Arnon;B. Buchberger
中科院分区:
文献类型:
--
作者:
D. S. Arnon;B. Buchberger
Since a real univariate polynomial does not always have real roots, a very natural algorithmic problem, is to design a method to count the number of real roots of a given polynomial (and thus decide whether it has any). The “real root counting problem” plays a key role in nearly all the “algorithms in real algebraic geometry” studied in this book. Much of mathematics is algorithmic, since the proofs of many theorems provide a finite procedure to answer some question or to calculate something. A classic example of this is the proof that any pair of real univariate polynomials (P, Q) have a greatest common divisor by giving a finite procedure for constructing the greatest common divisor of (P, Q), namely the euclidean remainder sequence. However, different procedures to solve a given problem differ in how much calculation is required by each to solve that problem. To understand what is meant by “how much calculation is required”, one needs a fuller understanding of what an algorithm is and what is meant by its “complexity”. This will be discussed at the beginning of the second part of the book, in Chapter 8.The first part of the book (Chapters 1 through 7) consists primarily of the mathematical background needed for the second part. Much of this background is already known and has appeared in various texts. Since these results come from many areas of mathematics such as geometry, algebra, topology and logic we thought it convenient to provide a self-contained, coherent exposition of these topics.