From cde18e23e727880ccd0a8fe0173dea1c86225a91 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sat, 23 Jul 2016 03:55:41 -0400
Subject: [PATCH] books/bookvolbib Axiom Citations in the Literature
Goal: Axiom Literate Programming
\index{Fateman, Richard J.}
\begin{chunk}{axiom.bib}
@misc{Fate06b,
author = "Fateman, Richard J.",
title = "Building Algebra Systems by Overloading Lisp: Automatic
Differentiation",
url = "http://www.cs.berkeley.edu/~/fateman/papers/overload-AD.pdf",
year = "2006",
abstract =
"In an earlier paper we began a discussion of the use of overloaded
languages for support of computer algebra systems. Here we extend that
notion to provide a more detailed approach to Automatic
Differentiation or Algorithm Differention (AD).
This paper makes three points. 1. It is extremely easy to do express
AD by overloading in Common Lisp. 2. While the resulting program is
not the most efficient approach in terms of run-time, it is quite
small and very general. It also interacts nicely with some other kinds
of generic arithmetic. 3. A more efficient AD compile-time program
generation approach is described as well.",
paper = "Fate06b.pdf",
keywords = "axiomref"
}
\end{chunk}
\index{Pfeil, Greg}
\begin{chunk}{axiom.bib}
@misc{Pfei12,
author = "Pfeil, Greg",
title = "Common Lisp Type Hierarchy",
year = "2012",
url = "http://sellout.github.io/2012/03/03/common-lisp-type-hierarchy"
}
\end{chunk}
---
books/bookvolbib.pamphlet | 82 +++++++++++++++++++++++++++++++++++++++-
changelog | 2 +
patch | 41 +++++++++++++++++++-
src/axiom-website/patches.html | 2 +
4 files changed, 124 insertions(+), 3 deletions(-)
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 32f40c3..4ceeadb 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -19154,7 +19154,7 @@ TPHOLS 2001, Edinburgh
program we developed can handle 43\% of 10,740 TeX formulas in a
well-known table of integrals. We expect that a higher success rte can
be achieved easily.",
- paper = "Fate99a.djvu",
+ paper = "Fate99a.pdf",
keywords = "axiomref"
}
@@ -19361,6 +19361,32 @@ TPHOLS 2001, Edinburgh
\end{chunk}
+\index{Fateman, Richard J.}
+\begin{chunk}{axiom.bib}
+@misc{Fate06b,
+ author = "Fateman, Richard J.",
+ title = "Building Algebra Systems by Overloading Lisp: Automatic
+ Differentiation",
+ url = "http://www.cs.berkeley.edu/~/fateman/papers/overload-AD.pdf",
+ year = "2006",
+ abstract =
+ "In an earlier paper we began a discussion of the use of overloaded
+ languages for support of computer algebra systems. Here we extend that
+ notion to provide a more detailed approach to Automatic
+ Differentiation or Algorithm Differention (AD).
+
+ This paper makes three points. 1. It is extremely easy to do express
+ AD by overloading in Common Lisp. 2. While the resulting program is
+ not the most efficient approach in terms of run-time, it is quite
+ small and very general. It also interacts nicely with some other kinds
+ of generic arithmetic. 3. A more efficient AD compile-time program
+ generation approach is described as well.",
+ paper = "Fate06b.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
\index{Faug\'ere, J.C.}
\index{Gianni, P.}
\index{Lazard, Daniel}
@@ -24764,6 +24790,49 @@ ISBN 0-89791-699-9 LCCN QA76.95 I59 1995 ACM order number 505950
\end{chunk}
+\index{Liao, Hsin-Chao}
+\index{Fateman, Richard J.}
+\begin{chunk}{axiom.bib}
+@inproceedings{Laio95,
+ author = "Liao, Hsin-Chao and Fateman, Richard J.",
+ title = "Evaluation of the heuristic polynomial GCD",
+ booktitle = "Proc. ISSAC 1995",
+ year = "1995",
+ pages = "240-247",
+ url = "http://www.cs.berkeley.edu/~/fateman/papers/phil8.ps",
+ abstract =
+ "The Heuristic Polynomial GCD procedure (GCDHEU) is used by the Maple
+ computer algebra system, but not other. Because Maple has an
+ especially efficient kernel that provides fast integer arithmetic, but
+ a relatively slower interpreter for non-kernel code, the GCDHEU
+ routine is especially effective in that it moves much of the
+ computation into ``bignum'' arithmetic and hence executes primarily in
+ the kernel.
+
+ We speculated that in other computer algebra systems an implementation
+ GCDHEU would not be advantageous. In particular, if {\sl all} the
+ system code is compiled to run at ``full speed'' in a (presumably more
+ bulky) kernel that is entirely written in C or compiled Lisp, then
+ there would seem to be no point in recasting the polynomial gcd
+ problem into a bignum GCD problem. Manipulating polynomials that are
+ vectors of coefficients would seem to be equivalent computationally to
+ manipulating vectors of big digits.
+
+ Yet our evidence suggests that one can take advantage of the GCDHEU in
+ a Lisp system as well. Given a good implementation of bignums, for
+ most small problems and many large ones, a substantial speedup can be
+ obtained by the appropriate choice of GCD algorithm, including often
+ enought, the GCDHEU approach. Another major winner seem to be the
+ subresultant polynomial remainder sequence algorithm. Because more
+ sophisticated sparse algorithms are relatively slow on small problems
+ and only occasionally emerge as superior (on larger problems) it seems
+ the choice of a fast GCD algorithm is tricky.",
+ paper = "phil8.pdf"
+}
+
+
+\end{chunk}
+
\index{Li, Xin}
\begin{chunk}{axiom.bib}
@phdthesis{Lixx05,
@@ -34365,6 +34434,17 @@ J. Inst. Maths Applics. 8 16--35. (1971)
\end{chunk}
+\index{Pfeil, Greg}
+\begin{chunk}{axiom.bib}
+@misc{Pfei12,
+ author = "Pfeil, Greg",
+ title = "Common Lisp Type Hierarchy",
+ year = "2012",
+ url = "http://sellout.github.io/2012/03/03/common-lisp-type-hierarchy"
+}
+
+\end{chunk}
+
\index{Philippe, M. Trebuchet}
\begin{chunk}{axiom.bib}
@phdthesis{Phil02,
diff --git a/changelog b/changelog
index 49c44c8..af37e16 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20160723 tpd src/axiom-website/patches.html 20160723.01.tpd.patch
+20160723 tpd books/bookvolbib Axiom Citations in the Literature
20160722 tpd src/axiom-website/patches.html 20160722.01.tpd.patch
20160722 tpd Makefile include cookbook directory
20160721 tpd src/axiom-website/patches.html 20160721.01.tpd.patch
diff --git a/patch b/patch
index 5678465..c3a34d8 100644
--- a/patch
+++ b/patch
@@ -1,5 +1,42 @@
-Makefile include cookbook directory
+books/bookvolbib Axiom Citations in the Literature
Goal: Axiom Literate Programming
-update Makefile to include cookbook directory
+\index{Fateman, Richard J.}
+\begin{chunk}{axiom.bib}
+@misc{Fate06b,
+ author = "Fateman, Richard J.",
+ title = "Building Algebra Systems by Overloading Lisp: Automatic
+ Differentiation",
+ url = "http://www.cs.berkeley.edu/~/fateman/papers/overload-AD.pdf",
+ year = "2006",
+ abstract =
+ "In an earlier paper we began a discussion of the use of overloaded
+ languages for support of computer algebra systems. Here we extend that
+ notion to provide a more detailed approach to Automatic
+ Differentiation or Algorithm Differention (AD).
+
+ This paper makes three points. 1. It is extremely easy to do express
+ AD by overloading in Common Lisp. 2. While the resulting program is
+ not the most efficient approach in terms of run-time, it is quite
+ small and very general. It also interacts nicely with some other kinds
+ of generic arithmetic. 3. A more efficient AD compile-time program
+ generation approach is described as well.",
+ paper = "Fate06b.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Pfeil, Greg}
+\begin{chunk}{axiom.bib}
+@misc{Pfei12,
+ author = "Pfeil, Greg",
+ title = "Common Lisp Type Hierarchy",
+ year = "2012",
+ url = "http://sellout.github.io/2012/03/03/common-lisp-type-hierarchy"
+}
+
+\end{chunk}
+
+
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index bf53d22..57919dc 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5496,6 +5496,8 @@ books/bookvolbib Axiom Citations in the Literature

books/cookbook/eucdom-gcd a first algorithmic recipe page

20160722.01.tpd.patch
Makefile include cookbook directory

+20160723.01.tpd.patch
+books/bookvolbib Axiom Citations in the Literature

--
1.7.5.4