From 4410a861ebbe3e9c1a8c31d38d5485981d2209b7 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Tue, 29 Aug 2017 09:06:27 -0400
Subject: [PATCH] books/bookvolbib add Doye references
Goal: Proving Axiom Correct
\index{Doye, Nicolas James}
\begin{chunk}{axiom.bib}
@misc{Doye93,
author = "Doye, Nicolas James",
title = "The Implementation of Various Algorithms for Permuation Groups
in the Computer Algebra System: AXIOM",
year = "1993",
comment = "M.Sc thesis, University of Bath",
link = "\url{https://static.worldofnic.org/cdn/ps/research/msc.ps}",
paper = "Doye93.pdf",
keywords = "axiomref"
}
\end{chunk}
\index{Watt, Stephen M.}
\index{Broadbery, Peter A.}
\index{Dooley, Sam}
\index{Iglio, Pietro}
\index{Steinbach, Jonathan M.}
\index{Morrison, Scott C.}
\index{Sutor, Robert S.}
\begin{chunk}{axiom.bib}
@misc{Watt94a,
author = "Watt, S.M. and Broadbery, P.A. and Dooley, S.S. and Iglio, P.
and Steinbach, J.M. and Morrison, S.C. and Sutor, R.S.",
title = "AXIOM Library Compiler Users Guide",
publisher = "The Numerical Algorithms Group (NAG) Ltd, 1994",
year = "1994",
keywords = "axiomref"
}
\end{chunk}
\index{Davenport, James H.}
\begin{chunk}{axiom.bib}
@article{Dave17,
author = "Davenport, James H.",
title = "A Generalized Successive Resultants Algorithm",
journal = "Lecture Notes in Computer Science",
volume = "10064",
year = "2017",
abstract =
"The Successive Resultants Algorithm (SRA) is a root-finding algorithm for
polynomials over $\mathbb{F}_{p^n}$ and was introdoced at ANTS in 2014.
THe algorithm is efficient when the characteristic $p$ is small and
$n > 1$. In this paper, we abstract the core SRA algorithm to arbitrary
finite fields and present three instantiations of our general algorithm,
one of which is novel and makes use of a series of isogenies derived
from elliptic curves with sufficiently smooth order.",
paper = "Dave17.pdf"
}
\end{chunk}
\index{Davenport, James}
\begin{chunk}{axiom.bib}
@misc{Dave17a,
author = "Davenport, James",
title = "Computer Algebra and Formal Proof",
year = "2017",
comment = "BPR presentation, Cambridge, England",
paper = "Dave17a.pdf"
}
\end{chunk}
---
books/bookvolbib.pamphlet | 67 ++++++++++++++++++++++++++++++++++-----
changelog | 2 ++
patch | 71 ++++++++++++++++++++++++++++++++++++++++--
src/axiom-website/patches.html | 2 ++
4 files changed, 133 insertions(+), 9 deletions(-)
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 4a0a761..483d7ed 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -4815,6 +4815,27 @@ when shown in factored form.
\end{chunk}
+\index{Davenport, James H.}
+\begin{chunk}{axiom.bib}
+@article{Dave17,
+ author = "Davenport, James H.",
+ title = "A Generalized Successive Resultants Algorithm",
+ journal = "Lecture Notes in Computer Science",
+ volume = "10064",
+ year = "2017",
+ abstract =
+ "The Successive Resultants Algorithm (SRA) is a root-finding algorithm for
+ polynomials over $\mathbb{F}_{p^n}$ and was introdoced at ANTS in 2014.
+ THe algorithm is efficient when the characteristic $p$ is small and
+ $n > 1$. In this paper, we abstract the core SRA algorithm to arbitrary
+ finite fields and present three instantiations of our general algorithm,
+ one of which is novel and makes use of a series of isogenies derived
+ from elliptic curves with sufficiently smooth order.",
+ paper = "Dave17.pdf"
+}
+
+\end{chunk}
+
\index{matrix computations}
\index{polynomial zero approximation}
\index{products of vectors}
@@ -4920,6 +4941,21 @@ when shown in factored form.
\end{chunk}
+\index{Doye, Nicolas James}
+\begin{chunk}{axiom.bib}
+@misc{Doye93,
+ author = "Doye, Nicolas James",
+ title = "The Implementation of Various Algorithms for Permuation Groups
+ in the Computer Algebra System: AXIOM",
+ year = "1993",
+ comment = "M.Sc thesis, University of Bath",
+ link = "\url{https://static.worldofnic.org/cdn/ps/research/msc.ps}",
+ paper = "Doye93.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
\index{Fateman, Richard}
\begin{chunk}{axiom.bib}
@inproceedings{Fate92a,
@@ -10386,6 +10422,18 @@ England, Matthew; Wilson, David
\end{chunk}
+\index{Davenport, James}
+\begin{chunk}{axiom.bib}
+@misc{Dave17a,
+ author = "Davenport, James",
+ title = "Computer Algebra and Formal Proof",
+ year = "2017",
+ comment = "BPR presentation, Cambridge, England",
+ paper = "Dave17a.pdf"
+}
+
+\end{chunk}
+
\index{Dijkstra, Edsger}
\begin{chunk}{axiom.bib}
@book{Dijk76,
@@ -11655,7 +11703,8 @@ England, Matthew; Wilson, David
author = "Martin, Ursula and Shand, D",
title = "Investigating some Embedded Verification Techniques for
Computer Algebra Systems",
- link = "\url{http://www.risc.jku.at/conferences/Theorema/papers/shand.ps.gz}",
+ link =
+ "\url{http://www.risc.jku.at/conferences/Theorema/papers/shand.ps.gz}",
abstract = "
This paper reports some preliminary ideas on a collaborative project
between St. Andrews University in the UK and NAG Ltd. The project aims
@@ -14505,7 +14554,7 @@ Lecture Notes in Computer Science V 72 pp415-425 (1979)
abstract =
"In this note, we look at the extension to the parallel Risch
algorithm (see, e.g., the papers by Norman and Moore [1977], Norman and
- Davenport [1979], ffitch [1981] or Davenport [1982] for a description
+ Davenport [1979], Fitch [1981] or Davenport [1982] for a description
of the basic algorithm) which represents trigonometric functions in
terms of tangents, rather than instead of complex exponentials.",
paper = "Dave82b.pdf"
@@ -29312,6 +29361,7 @@ ISBN 1-58113-073-2 LCCN QA76.95.I57 1999
year = "1999",
isbn = "1-58113-073-2",
link = "\url{http://www.acm.org/citation.cfm?id=309944}",
+ paper = "Doye99.pdf",
keywords = "axiomref",
beebe = "Doye:1999:ACA"
}
@@ -33794,7 +33844,7 @@ Draft September 5, 1988
\begin{chunk}{axiom.bib}
@InProceedings{Jenk94,
author = "Jenks, Richard D. and Trager, Barry M.",
- title = "How to make AXIOM into a scratchpad",
+ title = "How to make AXIOM into a Scratchpad",
booktitle = "Proceedings of the ACM-SIGSAM 1989 International
Symposium on Symbolic and Algebraic Computation, ISSAC '94",
series = "ISSAC 94",
@@ -41208,12 +41258,15 @@ IBM Research Division Technical Report RC19530 May 1994
\index{Steinbach, Jonathan M.}
\index{Morrison, Scott C.}
\index{Sutor, Robert S.}
-\begin{chunk}{ignore}
-\bibitem[Watt 95]{Wat95} Watt, S.M.; Broadbery, P.A.; Dooley, S.S.; Iglio, P.
-Steinbach, J.M.; Morrison, S.C.; Sutor, R.S.
+\begin{chunk}{axiom.bib}
+@misc{Watt94a,
+ author = "Watt, S.M. and Broadbery, P.A. and Dooley, S.S. and Iglio, P.
+ and Steinbach, J.M. and Morrison, S.C. and Sutor, R.S.",
title = "AXIOM Library Compiler Users Guide",
-The Numerical Algorithms Group (NAG) Ltd, 1994
+ publisher = "The Numerical Algorithms Group (NAG) Ltd, 1994",
+ year = "1994",
keywords = "axiomref"
+}
\end{chunk}
diff --git a/changelog b/changelog
index 1ebecd3..485c575 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20170828 tpd src/axiom-website/patches.html 20170828.01.tpd.patch
+20170828 tpd books/bookvolbib add Doye references
20170827 tpd src/axiom-website/patches.html 20170827.02.tpd.patch
20170827 tpd src/interp/patches.lisp coerce paths to strings
20170827 tpd src/axiom-website/patches.html 20170827.01.tpd.patch
diff --git a/patch b/patch
index f8c66bd..60f3870 100644
--- a/patch
+++ b/patch
@@ -1,4 +1,71 @@
-src/interp/patches.lisp coerce paths to strings
+books/bookvolbib add Doye references
-Goal: Axiom Maintenance
+Goal: Proving Axiom Correct
+
+\index{Doye, Nicolas James}
+\begin{chunk}{axiom.bib}
+@misc{Doye93,
+ author = "Doye, Nicolas James",
+ title = "The Implementation of Various Algorithms for Permuation Groups
+ in the Computer Algebra System: AXIOM",
+ year = "1993",
+ comment = "M.Sc thesis, University of Bath",
+ link = "\url{https://static.worldofnic.org/cdn/ps/research/msc.ps}",
+ paper = "Doye93.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Watt, Stephen M.}
+\index{Broadbery, Peter A.}
+\index{Dooley, Sam}
+\index{Iglio, Pietro}
+\index{Steinbach, Jonathan M.}
+\index{Morrison, Scott C.}
+\index{Sutor, Robert S.}
+\begin{chunk}{axiom.bib}
+@misc{Watt94a,
+ author = "Watt, S.M. and Broadbery, P.A. and Dooley, S.S. and Iglio, P.
+ and Steinbach, J.M. and Morrison, S.C. and Sutor, R.S.",
+ title = "AXIOM Library Compiler Users Guide",
+ publisher = "The Numerical Algorithms Group (NAG) Ltd, 1994",
+ year = "1994",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Davenport, James H.}
+\begin{chunk}{axiom.bib}
+@article{Dave17,
+ author = "Davenport, James H.",
+ title = "A Generalized Successive Resultants Algorithm",
+ journal = "Lecture Notes in Computer Science",
+ volume = "10064",
+ year = "2017",
+ abstract =
+ "The Successive Resultants Algorithm (SRA) is a root-finding algorithm for
+ polynomials over $\mathbb{F}_{p^n}$ and was introdoced at ANTS in 2014.
+ THe algorithm is efficient when the characteristic $p$ is small and
+ $n > 1$. In this paper, we abstract the core SRA algorithm to arbitrary
+ finite fields and present three instantiations of our general algorithm,
+ one of which is novel and makes use of a series of isogenies derived
+ from elliptic curves with sufficiently smooth order.",
+ paper = "Dave17.pdf"
+}
+
+\end{chunk}
+
+\index{Davenport, James}
+\begin{chunk}{axiom.bib}
+@misc{Dave17a,
+ author = "Davenport, James",
+ title = "Computer Algebra and Formal Proof",
+ year = "2017",
+ comment = "BPR presentation, Cambridge, England",
+ paper = "Dave17a.pdf"
+}
+
+\end{chunk}
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 310ce2a..99dcb53 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5812,6 +5812,8 @@ books/bookvolbug fix bootstrap code warnings

books/bookvol10.2 start adding html static pages

20170827.02.tpd.patch
src/interp/patches.lisp coerce paths to strings

+20170828.01.tpd.patch
+books/bookvolbib add Doye references

--
1.9.1