From d2df383954e85d4ecfc87653ca61a7509086b276 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Wed, 17 May 2017 17:44:38 -0400
Subject: [PATCH] bookvolbib Davenport CAD documentation
Goal: Axiom Literate Programming
\index{Davenport, J.H.}
\begin{chunk}{axiom.bib}
@techreport{Dave85a,
author = "Davenport, J.H.",
title = "Computer Algebra for Cylindrical Algebraic Decomposition",
institution = "NADA Kth Stockholm / Bath Ccomputer Science",
link = "\url{http://staff.bath.ac.uk/masjhd/TRITA.pdf}",
type = "technical report",
number = "88-10",
year = "1985",
abstract =
"This report describes techniques for resolving systems of polynomial
equations and inequalities. The general technique is {\sl cylindrical
algebraic decomposition}, which decomposes space into a number of
regions, on each of which the equations and inequalities have the
same sign. Most of the report is spent describing the algebraic and
algorithmic pre-requisites (resultants, algebraic numbers, Sturm
sequences, etc.), and then describing the method, first in two
dimensions and then in an artitrary number of dimensions.",
paper = "Dave85a.pdf"
}
\end{chunk}
\index{Collins, George E.}
\begin{chunk}{axiom.bib}
@article{Coll71,
author = "Collins, George E.",
title = "The Calculation of Multivariate Polynomial Resultants",
volume = "18",
number = "4",
year = "1971",
pages = "515-532",
abstract =
"An efficient algorithm is presented for the exact calculation of
resultants of multivariate polynomials with integer coefficients.
The algorithm applies modular homomorphisms and the Chinese remainder
theorem, evaluation homomorphisms and interpolation, in reducing
the problem to resultant calculation for univariate polynomials
over GF(p), whereupon a polynomial remainder sequence algorithm is used.
The computing time of the algorithm is analyzed theoretically as a
function of the degrees and coefficient sizes of its inputs. As a very
special case, it is shown that when all degrees are equal and the
coefficient size is fixed, its computing time is approximately
proportional to $\lambda^{2r+1}$, where $\lambda$ is the common
degree and $r$ is the number of variables.
Empirically observed computing times of the algorithm are tabulated
for a large number of examples, and other algorithms are compared.
Potential application of the algorithm to the solution of systems of
polynomial equations is discussed.",
paper = "Coll71.pdf"
}
\end{chunk}
---
books/bookvolbib.pamphlet | 82 ++++++++++++++++++++++++++++++++++++++++
changelog | 3 +
patch | 63 +++++++++++++++++++++++++++++-
src/axiom-website/patches.html | 2 +
4 files changed, 147 insertions(+), 3 deletions(-)
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 3de642b..f52cbf6 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -14429,6 +14429,31 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\index{Brown, Christopher W.}
+\begin{chunk}{axiom.bib}
+@article{Brow11,
+ author = "Brown, Christopher W.",
+ title = "Fast simplifications for Tarski formulas based on monomial
+ inequalities",
+ year = "2011",
+ journal = "Journal of Symbolic Computation",
+ volume = "47",
+ pages = "859-882",
+ abstract =
+ "We define the ``combinatorial part'' of a Tarski formula in which
+ equalities and inequalities are in factored or partially factored
+ form. The combinatorial part of a formula contains only ``monomial
+ inequalities'', which are sign conditions on monomials. We give
+ efficient algorithms for answering some basic questions about
+ conjunctions of monomial inequalities and prove the
+ NP-Completness/Hardness of some others. By simplifying the
+ combinatorial part back to a Tarski formula, we obtain non-trivial
+ simplifications without algebraic operations.",
+ paper = "Brow11.pdf"
+}
+
+\end{chunk}
+
\index{Caviness, B. F.}
\index{Johnson, J. R.}
\begin{chunk}{axiom.bib}
@@ -14500,6 +14525,39 @@ Proc ISSAC 97 pp172-175 (1997)
\index{Collins, George E.}
\begin{chunk}{axiom.bib}
+@article{Coll71,
+ author = "Collins, George E.",
+ title = "The Calculation of Multivariate Polynomial Resultants",
+ volume = "18",
+ number = "4",
+ year = "1971",
+ pages = "515-532",
+ abstract =
+ "An efficient algorithm is presented for the exact calculation of
+ resultants of multivariate polynomials with integer coefficients.
+ The algorithm applies modular homomorphisms and the Chinese remainder
+ theorem, evaluation homomorphisms and interpolation, in reducing
+ the problem to resultant calculation for univariate polynomials
+ over GF(p), whereupon a polynomial remainder sequence algorithm is used.
+
+ The computing time of the algorithm is analyzed theoretically as a
+ function of the degrees and coefficient sizes of its inputs. As a very
+ special case, it is shown that when all degrees are equal and the
+ coefficient size is fixed, its computing time is approximately
+ proportional to $\lambda^{2r+1}$, where $\lambda$ is the common
+ degree and $r$ is the number of variables.
+
+ Empirically observed computing times of the algorithm are tabulated
+ for a large number of examples, and other algorithms are compared.
+ Potential application of the algorithm to the solution of systems of
+ polynomial equations is discussed.",
+ paper = "Coll71.pdf"
+}
+
+\end{chunk}
+
+\index{Collins, George E.}
+\begin{chunk}{axiom.bib}
@article{Coll75,
author = "Collins, George E.",
title = "Quantifier Elimination for Real Closed Fields by
@@ -14538,6 +14596,30 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\index{Davenport, J.H.}
+\begin{chunk}{axiom.bib}
+@techreport{Dave85a,
+ author = "Davenport, J.H.",
+ title = "Computer Algebra for Cylindrical Algebraic Decomposition",
+ institution = "NADA Kth Stockholm / Bath Ccomputer Science",
+ link = "\url{http://staff.bath.ac.uk/masjhd/TRITA.pdf}",
+ type = "technical report",
+ number = "88-10",
+ year = "1985",
+ abstract =
+ "This report describes techniques for resolving systems of polynomial
+ equations and inequalities. The general technique is {\sl cylindrical
+ algebraic decomposition}, which decomposes space into a number of
+ regions, on each of which the equations and inequalities have the
+ same sign. Most of the report is spent describing the algebraic and
+ algorithmic pre-requisites (resultants, algebraic numbers, Sturm
+ sequences, etc.), and then describing the method, first in two
+ dimensions and then in an artitrary number of dimensions.",
+ paper = "Dave85a.pdf"
+}
+
+\end{chunk}
+
\index{RealClosure}
\index{Emiris, Ioannis Z.}
\index{Tsigaridas, Elias P.}
diff --git a/changelog b/changelog
index 243c62e..31cab68 100644
--- a/changelog
+++ b/changelog
@@ -1,5 +1,8 @@
+20170516 tpd src/axiom-website/patches.html 20170516.01.tpd.patch
+20170516 tpd bookvolbib Davenport CAD documentation
20170514 tpd src/axiom-website/patches.html 20170514.01.tpd.patch
20170514 tpd bookvol5 remove wildcard ? from help filenames
+20170514 tpd bookvol10.3 remove wildcard ? from help filenames
20170512 tpd src/axiom-website/patches.html 20170512.03.tpd.patch
20170512 tpd zips/gcl-2.6.13pre.tgz move to a new GCL version
20170512 tpd zips/gcl-2.6.13pre.cmpnew.gcl_cmpmain.lsp.patch
diff --git a/patch b/patch
index 77b3ad1..279a881 100644
--- a/patch
+++ b/patch
@@ -1,5 +1,62 @@
-bookvol5 remove wildcard ? from help filenames
+bookvolbib Davenport CAD documentation
+
+Goal: Axiom Literate Programming
+
+\index{Davenport, J.H.}
+\begin{chunk}{axiom.bib}
+@techreport{Dave85a,
+ author = "Davenport, J.H.",
+ title = "Computer Algebra for Cylindrical Algebraic Decomposition",
+ institution = "NADA Kth Stockholm / Bath Ccomputer Science",
+ link = "\url{http://staff.bath.ac.uk/masjhd/TRITA.pdf}",
+ type = "technical report",
+ number = "88-10",
+ year = "1985",
+ abstract =
+ "This report describes techniques for resolving systems of polynomial
+ equations and inequalities. The general technique is {\sl cylindrical
+ algebraic decomposition}, which decomposes space into a number of
+ regions, on each of which the equations and inequalities have the
+ same sign. Most of the report is spent describing the algebraic and
+ algorithmic pre-requisites (resultants, algebraic numbers, Sturm
+ sequences, etc.), and then describing the method, first in two
+ dimensions and then in an artitrary number of dimensions.",
+ paper = "Dave85a.pdf"
+}
+
+\end{chunk}
+
+\index{Collins, George E.}
+\begin{chunk}{axiom.bib}
+@article{Coll71,
+ author = "Collins, George E.",
+ title = "The Calculation of Multivariate Polynomial Resultants",
+ volume = "18",
+ number = "4",
+ year = "1971",
+ pages = "515-532",
+ abstract =
+ "An efficient algorithm is presented for the exact calculation of
+ resultants of multivariate polynomials with integer coefficients.
+ The algorithm applies modular homomorphisms and the Chinese remainder
+ theorem, evaluation homomorphisms and interpolation, in reducing
+ the problem to resultant calculation for univariate polynomials
+ over GF(p), whereupon a polynomial remainder sequence algorithm is used.
+
+ The computing time of the algorithm is analyzed theoretically as a
+ function of the degrees and coefficient sizes of its inputs. As a very
+ special case, it is shown that when all degrees are equal and the
+ coefficient size is fixed, its computing time is approximately
+ proportional to $\lambda^{2r+1}$, where $\lambda$ is the common
+ degree and $r$ is the number of variables.
+
+ Empirically observed computing times of the algorithm are tabulated
+ for a large number of examples, and other algorithms are compared.
+ Potential application of the algorithm to the solution of systems of
+ polynomial equations is discussed.",
+ paper = "Coll71.pdf"
+}
+
+\end{chunk}
-Goal: Axiom Maintenance
-member? becomes memberq for filename lookup
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 7a82937..a06e39e 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5722,6 +5722,8 @@ bookvolbib Cylindrical Algebraic Decomposition references

gcl-2.6.13pre move to a new GCL version

20170514.01.tpd.patch
bookvol5 remove wildcard ? from help filenames

+20170516.01.tpd.patch
+bookvolbib Davenport CAD documentation

--
1.7.5.4