From 425a622556ea9483d9994dca5903b868cfa625fa Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sun, 10 Jul 2016 03:00:40 0400
Subject: [PATCH] books/bookvolbib Axiom Citations in the Literature
Goal: Axiom Literate Programming
\index{Hawkes, Evatt}
\index{Keady, Grant}
\begin{chunk}{axiom.bib}
@inproceedings{Hawk95,
author = "Hawkes, Evatt and Keady, Grant",
title = "Two more links to NAG numerics involving CA systems",
booktitle = "IMACS Applied Computer Algebra Conference",
location = "University of New Mexico",
year = "1995",
keywords = "axiomref",
paper = "Hawk95.pdf",
algebra =
"\newline\refto{domain ASP1 Asp1}
\newline\refto{domain ASP10 Asp10}
\newline\refto{domain ASP12 Asp12}
\newline\refto{domain ASP19 Asp19}
\newline\refto{domain ASP20 Asp20}
\newline\refto{domain ASP24 Asp24}
\newline\refto{domain ASP27 Asp27}
\newline\refto{domain ASP28 Asp28}
\newline\refto{domain ASP29 Asp29}
\newline\refto{domain ASP30 Asp30}
\newline\refto{domain ASP31 Asp31}
\newline\refto{domain ASP33 Asp33}
\newline\refto{domain ASP34 Asp34}
\newline\refto{domain ASP35 Asp35}
\newline\refto{domain ASP4 Asp4}
\newline\refto{domain ASP41 Asp41}
\newline\refto{domain ASP42 Asp42}
\newline\refto{domain ASP49 Asp49}
\newline\refto{domain ASP50 Asp50}
\newline\refto{domain ASP55 Asp55}
\newline\refto{domain ASP6 Asp6}
\newline\refto{domain ASP7 Asp7}
\newline\refto{domain ASP73 Asp73}
\newline\refto{domain ASP74 Asp74}
\newline\refto{domain ASP77 Asp77}
\newline\refto{domain ASP78 Asp78}
\newline\refto{domain ASP8 Asp8}
\newline\refto{domain ASP80 Asp80}
\newline\refto{domain ASP9 Asp9}",
abstract =
"The 'more' in the title is because this paper is a sequel to papers
by Keving Broughan, [BKRRD,BK]. For some years GK has had interests in
(i) interactive frontends to numeric computation, such as the
NAG/IMSL library computation, and (ii) Fortran code generation for
Argument SubPrograms (ASPs), such as those neede by some NAG/IMSL
routines. Demonstrations of three links to the NAG library are
described in [BKRRD]. A description of a link to NAG from Macsyma
which was mentioned, but not in a sufficiently advanced state to
demonstrate in early 1991, is given in [BK]. The situation at the end
of 1991 was that there were links to NAG involving each of Macsyma,
REDUCE and Mathematica. The links are called Naglink, IRENA and
InterCall, respectively. The principal authors of IRENA are Mike Dewar
and Mike Richardson. InterCall is not specific to the NAG library;
indeed InterCall is used with calls to IMSL and to elsewhere at the
conference venue, the University of New Mexico.
The two futher links to NAG library treated in this paper are AXIOM2.0
and genmex/ESC, genmex allows calls to NAG from Matlab. genmex can be
regarded as similar to InterCall: genmes uses Matlab's mex files in a
similar way to InterCall's use of Mathematica's MathLink. Again genmex
is not specific to the NAG library. Mike Dewar is an author both of
IRENA and the AXIOM2.0 link to the NAG library: see [D] foe discussion
of the differences between the IRENA project and the AXIOMNAG link
project."
}
\end{chunk}
\index{Keady, G.}
\index{Nolan, G.}
\begin{chunk}{axiom.bib}
@inproceedings{Kead93,
author = "Keady, G. and Nolan, G.",
title = "Production of Argument SubPrograms in the AXIOM  NAG link:
examples involving nonlinear systems",
booktitle = "Proc. Workshop on Symbolic and Numeric Computation",
location = "Helsinki",
year = "1993",
pages = "1332",
comment = "NAG Technical Report TR1/94",
url = "school.maths.uwa.edu.au/%7Ekeady/KeadyPapers/93Helsinki.ps",
paper = "Kead93.pdf",
keywords = "axiomref",
algebra =
"\newline\refto{domain ASP1 Asp1}
\newline\refto{domain ASP10 Asp10}
\newline\refto{domain ASP12 Asp12}
\newline\refto{domain ASP19 Asp19}
\newline\refto{domain ASP20 Asp20}
\newline\refto{domain ASP24 Asp24}
\newline\refto{domain ASP27 Asp27}
\newline\refto{domain ASP28 Asp28}
\newline\refto{domain ASP29 Asp29}
\newline\refto{domain ASP30 Asp30}
\newline\refto{domain ASP31 Asp31}
\newline\refto{domain ASP33 Asp33}
\newline\refto{domain ASP34 Asp34}
\newline\refto{domain ASP35 Asp35}
\newline\refto{domain ASP4 Asp4}
\newline\refto{domain ASP41 Asp41}
\newline\refto{domain ASP42 Asp42}
\newline\refto{domain ASP49 Asp49}
\newline\refto{domain ASP50 Asp50}
\newline\refto{domain ASP55 Asp55}
\newline\refto{domain ASP6 Asp6}
\newline\refto{domain ASP7 Asp7}
\newline\refto{domain ASP73 Asp73}
\newline\refto{domain ASP74 Asp74}
\newline\refto{domain ASP77 Asp77}
\newline\refto{domain ASP78 Asp78}
\newline\refto{domain ASP8 Asp8}
\newline\refto{domain ASP80 Asp80}
\newline\refto{domain ASP9 Asp9}",
abstract =
"Dewar's paper [6] earlier in this Proceedings 'sketches out the
design of the AXIOMNAG link' and gives a general account of new tools
for generating Fortran. This paper is a sequel to [6]. Here we present
'examples' of some of the items discussed in [6]. We have attempted to
achieve some coherence by selecting our 'examples' from just the one
application area  solving nonlinear systems."
}
\end{chunk}
\index{Fateman, Richard J.}
\index{Einwohner, Theodore H.}
\begin{chunk}{axiom.bib}
@misc{Fate92,
author = "Fateman, Richard J. and Einwohner, Theodore H.",
title = "A Proposal for Automated Integral Tables (Work in Progress)",
year = "1992",
url = "http://people.eecs.berkeley.edu/~fateman/papers/intable.pdf",
paper = "Fate92.pdf",
abstract =
"One of the longterm general goals of algebraic manipulation systems
has been the automation of difficult or tedious, yet common, symbolic
mathematical operations. Prominent amount these has been symbolic
integration. Although some effective algorithms have been devised for
integration expecially for those problems solvable in terms of
elementary functions and a few additional special functions, the vast
majority of entires in large tables of indefinite and definite
integrals remain out of reach of current machine algorithms. We
propose techniques for introducing the information in such tables to
computers, extending such tables, and measuring the success of such
automation.
Similar tabular data concerning simplifications, summation identities,
and similar formulas could also be treated by some of the same
techniques."
}
\end{chunk}
\index{Dewar, Michael C.}
\begin{chunk}{axiom.bib}
@phdthesis{Dewa91,
author = "Dewar, Michael C.",
title = "Interfacing algebraic and numeric computation",
year = "1991",
institution = "University of Bath, UK, England"
}
\end{chunk}
\index{Dupee, Brian J.}
\index{Davenport, James H.}
\begin{chunk}{axiom.bib}
@misc{Dupe99,
author = "Dupee, Brian J. and Davenport, James H.",
title = "An Automatic SymbolicNumeric Taylor Series ODE Solver",
year = "1999",
paper = "Dupe99.pdf",
url = "http://people.eecs.berkeley.edu/~fateman/papers/casc9934.pdf",
keywords = "axiomref",
algebra = "\newline\refto{package EXPRODE ExpressionSpaceODESolver}",
abstract =
"One of the basic techniques in every mathematician's toolkit is the
Taylor series representation of functions. It is of such fundamental
importance and it is so well understood that its use is often a first
choice in numerical analysis. This faith has not, unfortunately, been
transferred to the design of computer algorithms.
Approximation by use of Taylor series methods is inherently partly a
symbolic process and partly numeric> This aspect has often, with
reason, been regared as a major hindrance in algorithm design. Whilst
attempts have been made in the past to build a consistent set of
programs for the symbolic and numeric paradigms, these have been
necessarily multistage processes.
Using current technology it has at last become possible to integrate
these two concepts and build an automatic adaptive symbolicnumeric
algorithm within a uniform framework which can hide the internal
workings behind a modern interface."
}
\end{chunk}
\index{ExpressionSpaceODESolver}
\index{Lambe, Larry A.}
\index{Luczak, Richard}
\index{Nehrbass, John W.}
\begin{chunk}{axiom.bib}
@article{Lamb03,
author = "Lambe, Larry A. and Luczak, Richard and Nehrbass, John W.",
title = "A New Finite Difference Method for the Helmholtz Equation
Using Symbolic Computation",
journal = "Int. J. Comp. Eng. Sci.",
volume = "4",
year = "2003",
url = "http://pages.bangor.ac.uk.~mas019/papers/lln.pdf",
paper = "Lamb03.pdf"
keywords = "axiomref",
abstract =
"A new finite difference method for the Helmholtz equation is
presented. The method involves replacing the standard ``weights'' in the
central difference quotients (Secs. 2.1, 2.2, and 2.3) by weights that
are optimal in a sense that will be explained in the sections just
mentioned. The calculation of the optimal weights involves some
complicated and errorprone manipulations of integral formulas that is
best done using computeraided symbolic computation (SC). In addition,
we discuss the important problem of interpolation involving meshes
that have been refined in certain subregions. Analytic formulae are
derived using SC for these interpolation schemes. Our results are
discussed in Sec. 5. Some hints about the computer methods we used to
accomplish these results are given in the Appendix. More information
is available and access to that information is referenced.
While we do not want to make SC the focus of this work, we also do not
want to underestimate its value. Armed with robust and efficient SC
libraries, a researcher can {\sl comfortably} and {\sl conveniently}
experiment with ideas that he or she might not examine otherwise."
}
\end{chunk}

books/bookvol10.3.pamphlet  145 +++++++++++++
books/bookvol10.4.pamphlet  4 +
books/bookvolbib.pamphlet  453 +++++++++++++++++++++++++++++++++++++
changelog  4 +
patch  395 +++++++++++++++++
src/axiomwebsite/patches.html  2 +
6 files changed, 773 insertions(+), 230 deletions()
diff git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index b2ce49d..24bd5c2 100644
 a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ 7728,11 +7728,16 @@ o )show Asp1
\cross{ASP1}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP1 Asp1}
\begin{chunk}{domain ASP1 Asp1}
)abbrev domain ASP1 Asp1
++ Author: Mike Dewar, Grant Keady, Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 18 March 1994, 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp1} produces Fortran for Type 1 ASPs, needed for various
++ NAG routines. Type 1 ASPs take a univariate expression (in the symbol x)
@@ 8022,11 +8027,16 @@ o )show Asp10
\cross{ASP10}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP10 Asp10}
\begin{chunk}{domain ASP10 Asp10}
)abbrev domain ASP10 Asp10
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 18 March 1994, 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{ASP10} produces Fortran for Type 10 ASPs, needed for NAG routine
++ d02kef. This ASP computes the values of a set of functions, for example:
@@ 8362,11 +8372,16 @@ o )show Asp12
\cross{ASP12}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP12 Asp12}
\begin{chunk}{domain ASP12 Asp12}
)abbrev domain ASP12 Asp12
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Oct 1993
++ Date Last Updated: 21 June 1994 Changed print to printStatement
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp12} produces Fortran for Type 12 ASPs, needed for NAG routine
++ d02kef etc., for example:
@@ 8657,11 +8672,16 @@ o )show Asp19
\cross{ASP19}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP19 Asp19}
\begin{chunk}{domain ASP19 Asp19}
)abbrev domain ASP19 Asp19
++ Author: Mike Dewar, Godfrey Nolan, Grant Keady
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp19} produces Fortran for Type 19 ASPs, evaluating a set of
++functions and their jacobian at a given point, for example:
@@ 9189,11 +9209,16 @@ o )show Asp20
\cross{ASP20}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP20 Asp20}
\begin{chunk}{domain ASP20 Asp20}
)abbrev domain ASP20 Asp20
++ Author: Mike Dewar and Godfrey Nolan and Grant Keady
++ Date Created: Dec 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp20} produces Fortran for Type 20 ASPs, for example:
++
@@ 9581,11 +9606,16 @@ o )show Asp24
\cross{ASP20}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP24 Asp24}
\begin{chunk}{domain ASP24 Asp24}
)abbrev domain ASP24 Asp24
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp24} produces Fortran for Type 24 ASPs which evaluate a
++multivariate function at a point (needed for NAG routine e04jaf),
@@ 9887,11 +9917,16 @@ o )show Asp27
\cross{ASP27}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP27 Asp27}
\begin{chunk}{domain ASP27 Asp27}
)abbrev domain ASP27 Asp27
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Nov 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp27} produces Fortran for Type 27 ASPs, needed for NAG routine
++f02fjf ,for example:
@@ 10257,11 +10292,16 @@ o )show Asp28
\cross{ASP28}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP28 Asp28}
\begin{chunk}{domain ASP28 Asp28}
)abbrev domain ASP28 Asp28
++ Author: Mike Dewar
++ Date Created: 21 March 1994
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp28} produces Fortran for Type 28 ASPs, used in NAG routine
++f02fjf, for example:
@@ 10608,11 +10648,16 @@ o )show Asp29
\cross{ASP29}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP29 Asp29}
\begin{chunk}{domain ASP29 Asp29}
)abbrev domain ASP29 Asp29
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Nov 1993
++ Date Last Updated: 18 March 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp29} produces Fortran for Type 29 ASPs, needed for NAG routine
++f02fjf, for example:
@@ 10830,11 +10875,16 @@ o )show Asp30
\cross{ASP30}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP30 Asp30}
\begin{chunk}{domain ASP30 Asp30}
)abbrev domain ASP30 Asp30
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Nov 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp30} produces Fortran for Type 30 ASPs, needed for NAG routine
++f04qaf, for example:
@@ 11144,11 +11194,16 @@ o )show Asp31
\cross{ASP31}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP31 Asp31}
\begin{chunk}{domain ASP31 Asp31}
)abbrev domain ASP31 Asp31
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp31} produces Fortran for Type 31 ASPs, needed for NAG routine
++d02ejf, for example:
@@ 11502,11 +11557,16 @@ o )show Asp33
\cross{ASP33}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP33 Asp33}
\begin{chunk}{domain ASP33 Asp33}
)abbrev domain ASP33 Asp33
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Nov 1993
++ Date Last Updated: 30 March 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp33} produces Fortran for Type 33 ASPs, needed for NAG routine
++d02kef. The code is a dummy ASP:
@@ 11667,11 +11727,16 @@ o )show Asp34
\cross{ASP34}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP34 Asp34}
\begin{chunk}{domain ASP34 Asp34}
)abbrev domain ASP34 Asp34
++ Author: Mike Dewar and Godfrey Nolan and Themos Tsikas
++ Date Created: Nov 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp34} produces Fortran for Type 34 ASPs, needed for NAG routine
++f04mbf, for example:
@@ 11947,11 +12012,16 @@ o )show Asp35
\cross{ASP35}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP35 Asp35}
\begin{chunk}{domain ASP35 Asp35}
)abbrev domain ASP35 Asp35
++ Author: Mike Dewar, Godfrey Nolan, Grant Keady
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp35} produces Fortran for Type 35 ASPs, needed for NAG routines
++c05pbf, c05pcf, for example:
@@ 12352,11 +12422,16 @@ o )show Asp4
\cross{ASP4}{retractIfCan} &
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP4 Asp4}
\begin{chunk}{domain ASP4 Asp4}
)abbrev domain ASP4 Asp4
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp4} produces Fortran for Type 4 ASPs, which take an expression
++in X(1) .. X(NDIM) and produce a real function of the form:
@@ 12679,11 +12754,16 @@ o )show Asp41
\cross{ASP41}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP41 Asp41}
\begin{chunk}{domain ASP41 Asp41}
)abbrev domain ASP41 Asp41
++ Author: Mike Dewar, Godfrey Nolan
++ Date Created:
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp41} produces Fortran for Type 41 ASPs, needed for NAG
++routines d02raf and d02saf in particular. These ASPs are in fact
@@ 13223,11 +13303,16 @@ o )show Asp42
\cross{ASP42}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP42 Asp42}
\begin{chunk}{domain ASP42 Asp42}
)abbrev domain ASP42 Asp42
++ Author: Mike Dewar, Godfrey Nolan
++ Date Created:
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp42} produces Fortran for Type 42 ASPs, needed for NAG
++routines d02raf and d02saf
@@ 13785,11 +13870,16 @@ o )show Asp49
\cross{ASP49}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP49 Asp49}
\begin{chunk}{domain ASP49 Asp49}
)abbrev domain ASP49 Asp49
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp49} produces Fortran for Type 49 ASPs, needed for NAG routines
++e04dgf, e04ucf, for example:
@@ 14192,11 +14282,16 @@ o )show Asp50
\cross{ASP50}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP50 Asp50}
\begin{chunk}{domain ASP50 Asp50}
)abbrev domain ASP50 Asp50
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp50} produces Fortran for Type 50 ASPs, needed for NAG routine
++e04fdf, for example:
@@ 14591,11 +14686,16 @@ o )show Asp55
\cross{ASP55}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP55 Asp55}
\begin{chunk}{domain ASP55 Asp55}
)abbrev domain ASP55 Asp55
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: June 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++\spadtype{Asp55} produces Fortran for Type 55 ASPs, needed for NAG routines
++e04dgf and e04ucf, for example:
@@ 15084,11 +15184,16 @@ o )show Asp6
\cross{ASP6}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP6 Asp6}
\begin{chunk}{domain ASP6 Asp6}
)abbrev domain ASP6 Asp6
++ Author: Mike Dewar and Godfrey Nolan and Grant Keady
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp6} produces Fortran for Type 6 ASPs, needed for NAG routines
++ c05nbf, c05ncf. These represent vectors of functions of X(i) and look like:
@@ 15440,11 +15545,16 @@ o )show Asp7
\cross{ASP7}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP7 Asp7}
\begin{chunk}{domain ASP7 Asp7}
)abbrev domain ASP7 Asp7
++ Author: Mike Dewar and Godfrey Nolan and Grant Keady
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp7} produces Fortran for Type 7 ASPs, needed for NAG routines
++ d02bbf, d02gaf. These represent a vector of functions of the scalar X and
@@ 15780,11 +15890,16 @@ o )show Asp73
\cross{ASP73}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP73 Asp73}
\begin{chunk}{domain ASP73 Asp73}
)abbrev domain ASP73 Asp73
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 30 March 1994, 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp73} produces Fortran for Type 73 ASPs, needed for NAG routine
++ d03eef, for example:
@@ 16163,11 +16278,16 @@ o )show Asp74
\cross{ASP74}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP74 Asp74}
\begin{chunk}{domain ASP74 Asp74}
)abbrev domain ASP74 Asp74
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Oct 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp74} produces Fortran for Type 74 ASPs, needed for NAG routine
++ d03eef, for example:
@@ 16579,11 +16699,16 @@ o )show Asp77
\cross{ASP77}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP77 Asp77}
\begin{chunk}{domain ASP77 Asp77}
)abbrev domain ASP77 Asp77
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp77} produces Fortran for Type 77 ASPs, needed for NAG routine
++ d02gbf, for example:
@@ 16926,11 +17051,16 @@ o )show Asp78
\cross{ASP78}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP78 Asp78}
\begin{chunk}{domain ASP78 Asp78}
)abbrev domain ASP78 Asp78
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp78} produces Fortran for Type 78 ASPs, needed for NAG routine
++ d02gbf, for example:
@@ 17260,11 +17390,16 @@ o )show Asp8
\cross{ASP8}{outputAsFortran}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP8 Asp8}
\begin{chunk}{domain ASP8 Asp8}
)abbrev domain ASP8 Asp8
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: 11 February 1994
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp8} produces Fortran for Type 8 ASPs, needed for NAG routine
++ d02bbf. This ASP prints intermediate values of the computed solution of
@@ 17557,11 +17692,16 @@ o )show Asp80
\cross{ASP80}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP80 Asp80}
\begin{chunk}{domain ASP80 Asp80}
)abbrev domain ASP80 Asp80
++ Author: Mike Dewar and Godfrey Nolan
++ Date Created: Oct 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp80} produces Fortran for Type 80 ASPs, needed for NAG routine
++ d02kef, for example:
@@ 17917,11 +18057,16 @@ o )show Asp9
\cross{ASP9}{retractIfCan}
\end{tabular}
+See Hawkes\cite{Hawk95}, Keady\cite{Kead93}
+\label{domain ASP9 Asp9}
\begin{chunk}{domain ASP9 Asp9}
)abbrev domain ASP9 Asp9
++ Author: Mike Dewar, Grant Keady and Godfrey Nolan
++ Date Created: Mar 1993
++ Date Last Updated: 6 October 1994
+++ References:
+++ Hawk95 Two more links to NAG numerics involving CA systems
+++ Kead93 Production of Argument SubPrograms in the AXIOM  NAG link
++ Description:
++ \spadtype{Asp9} produces Fortran for Type 9 ASPs, needed for NAG routines
++ d02bhf, d02cjf, d02ejf.
diff git a/books/bookvol10.4.pamphlet b/books/bookvol10.4.pamphlet
index 0a139a3..a5febd1 100644
 a/books/bookvol10.4.pamphlet
+++ b/books/bookvol10.4.pamphlet
@@ 44577,11 +44577,15 @@ o )show ExpressionSpaceODESolver
{\bf Exports:}\\
\cross{EXPRODE}{seriesSolve}
+See: Dupee\{Dupe99}
+\label{package EXPRODE ExpressionSpaceODESolver}
\begin{chunk}{package EXPRODE ExpressionSpaceODESolver}
)abbrev package EXPRODE ExpressionSpaceODESolver
++ Author: Manuel Bronstein
++ Date Created: 5 Mar 1990
++ Date Last Updated: 30 September 1993
+++ References:
+++ Dupe99 An Automatic SymbolicNumeric Taylor Series ODE Solver
++ Description:
++ Taylor series solutions of explicit ODE's;
diff git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index b720db4..193daac 100644
 a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ 10571,6 +10571,46 @@ J. Symbolic Computation 5, 237259 (1988)
\section{To Be Classified} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\index{Dewar, Michael C.}
+\begin{chunk}{axiom.bib}
+@phdthesis{Dewa91,
+ author = "Dewar, Michael C.",
+ title = "Interfacing algebraic and numeric computation",
+ year = "1991",
+ institution = "University of Bath, UK, England"
+}
+
+\end{chunk}
+
+\index{Fateman, Richard J.}
+\index{Einwohner, Theodore H.}
+\begin{chunk}{axiom.bib}
+@misc{Fate92,
+ author = "Fateman, Richard J. and Einwohner, Theodore H.",
+ title = "A Proposal for Automated Integral Tables (Work in Progress)",
+ year = "1992",
+ url = "http://people.eecs.berkeley.edu/~fateman/papers/intable.pdf",
+ paper = "Fate92.pdf",
+ abstract =
+"One of the longterm general goals of algebraic manipulation systems
+has been the automation of difficult or tedious, yet common, symbolic
+mathematical operations. Prominent amount these has been symbolic
+integration. Although some effective algorithms have been devised for
+integration expecially for those problems solvable in terms of
+elementary functions and a few additional special functions, the vast
+majority of entires in large tables of indefinite and definite
+integrals remain out of reach of current machine algorithms. We
+propose techniques for introducing the information in such tables to
+computers, extending such tables, and measuring the success of such
+automation.
+
+Similar tabular data concerning simplifications, summation identities,
+and similar formulas could also be treated by some of the same
+techniques."
+}
+
+\end{chunk}
+
\index{Athale, Rahul Ramesh}
\index{Diaz, Glauco Alfredo Lopez}
\begin{chunk}{axiom.bib}
@@ 12218,6 +12258,20 @@ American Mathematical Society (1994)
\end{chunk}
+\begin{chunk}
+@misc{AxiomPressRelease,
+ author = "Numerical Algorithms Group",
+ title = "Axiom Press Release",
+ url = "http://www.dorn.org/uni/sls/kap05/e08\_01.htm",
+ paper = "AxiomPressRelease.tgz"
+ year = "1996",
+ month = "July",
+ day = "24",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
\subsection{B} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\index{Baclawski, Krystian}
@@ 12469,7 +12523,7 @@ IBM Research Report, RC3062 Sept
author = "Boyle, Ann and Caviness, B.F. and Hearn, Anthony C.",
title = "Future Directions for Research in Symbolic Computation",
publisher = "Soc. for Industrial and Applied Mathematics",
 year = "1988"
+ year = "1988",
url = "http://www.eecis.udel.edu/~caviness/wsreport.pdf",
paper = "Boyl88.pdf",
keywords = "axiomref"
@@ 15500,34 +15554,6 @@ Grant citation GR/L48256 Nov 1, 1997Feb 28, 2001
\end{chunk}
\index{d01ajfAnnaType}
\index{d01akfAnnaType}
\index{d01alfAnnaType}
\index{d01amfAnnaType}
\index{d01anfAnnaType}
\index{d01apfAnnaType}
\index{d01aqfAnnaType}
\index{d01asfAnnaType}
\index{d01fcfAnnaType}
\index{d01gbfAnnaType}
\index{d01TransformFunctionType}
\index{d02bbfAnnaType}
\index{d02bhfAnnaType}
\index{d02cjfAnnaType}
\index{d02ejfAnnaType}
\index{d03eefAnnaType}
\index{d03fafAnnaType}
\index{e04dgfAnnaType}
\index{e04fdfAnnaType}
\index{e04gcfAnnaType}
\index{e04jafAnnaType}
\index{e04mbfAnnaType}
\index{e04nafAnnaType}
\index{e04ucfAnnaType}
\index{NumericalIntegrationProblem}
\index{NumericalODEProblem}
\index{NumericalOptimizationProblem}
\index{NumericalPDEProblem}
\index{Dupee, Brian J.}
\index{Davenport, James H.}
\begin{chunk}{axiom.bib}
@@ 15603,6 +15629,107 @@ Grant citation GR/L48256 Nov 1, 1997Feb 28, 2001
}
\end{chunk}
+\index{d01ajfAnnaType}
+\index{d01akfAnnaType}
+\index{d01alfAnnaType}
+\index{d01amfAnnaType}
+\index{d01anfAnnaType}
+\index{d01apfAnnaType}
+\index{d01aqfAnnaType}
+\index{d01asfAnnaType}
+\index{d01fcfAnnaType}
+\index{d01gbfAnnaType}
+\index{d01TransformFunctionType}
+\index{d02bbfAnnaType}
+\index{d02bhfAnnaType}
+\index{d02cjfAnnaType}
+\index{d02ejfAnnaType}
+\index{d03eefAnnaType}
+\index{d03fafAnnaType}
+\index{e04dgfAnnaType}
+\index{e04fdfAnnaType}
+\index{e04gcfAnnaType}
+\index{e04jafAnnaType}
+\index{e04mbfAnnaType}
+\index{e04nafAnnaType}
+\index{e04ucfAnnaType}
+\index{NumericalIntegrationProblem}
+\index{NumericalODEProblem}
+\index{NumericalOptimizationProblem}
+\index{NumericalPDEProblem}
+
+\index{Dupee, Brian J.}
+\index{Davenport, James H.}
+\begin{chunk}{axiom.bib}
+@inproceedings{Dupe99,
+ author = "Dupee, Brian J. and Davenport, James H.",
+ title = "An Automatic SymbolicNumeric Taylor Series ODE Solver",
+ booktitle = "Computer Algebra in Scientific Computing, CASC'99",
+ isbn = "9783540660477",
+ pages = "3750",
+ year = "1999",
+ paper = "Dupe99.pdf",
+ url = "http://people.eecs.berkeley.edu/~fateman/papers/casc9934.pdf",
+ keywords = "axiomref",
+ comment = "Contains FORTRAN Code of Taylor Series",
+ algebra = "\newline\refto{package EXPRODE ExpressionSpaceODESolver}",
+ abstract =
+ "One of the basic techniques in every mathematician's toolkit is the
+ Taylor series representation of functions. It is of such fundamental
+ importance and it is so well understood that its use is often a first
+ choice in numerical analysis. This faith has not, unfortunately, been
+ transferred to the design of computer algorithms.
+
+ Approximation by use of Taylor series methods is inherently partly a
+ symbolic process and partly numeric> This aspect has often, with
+ reason, been regared as a major hindrance in algorithm design. Whilst
+ attempts have been made in the past to build a consistent set of
+ programs for the symbolic and numeric paradigms, these have been
+ necessarily multistage processes.
+
+ Using current technology it has at last become possible to integrate
+ these two concepts and build an automatic adaptive symbolicnumeric
+ algorithm within a uniform framework which can hide the internal
+ workings behind a modern interface."
+}
+
+\end{chunk}
+\index{ExpressionSpaceODESolver}
+
+\index{Dupee, Brian J.}
+\index{Davenport, James H.}
+\begin{chunk}{axiom.bib}
+@inproceedings{Dupe05,
+ author = "Dupee, Brian J. and Davenport, James H.",
+ title = "An Intelligent Interface to Numerical Routines",
+ booktitle = "Design and Implementation of Symbolic Computation Systems",
+ series = "Lecture Notes in Computer Science 1128",
+ pages = "252262",
+ publisher = "Springer",
+ year = "2005",
+ abstract =
+ "Links from Computer Algebra Systems to Numerical Libraries have been
+ increasingly made available. However, the remain, like the numerical
+ routines which comprise those libraries, difficult to use by a novice
+ and there is little help in choosing the appropriate routine for any
+ given problem, should there be a choice.
+
+ Compuer Algebra Systems use generic names for each problem area. For
+ examples, 'integrate' (or 'int') is used for integration of a
+ function, whatever method the code may use. Numeric interfaces still
+ use different names for each method together with a variety of extra
+ parameters, some of which may be optional. Ideally, we should extend
+ the generic name structure to cover numerical routines. This would
+ then, necessarily, require algorithms for making an assessment of the
+ efficacy of different methods where such a choice exists.
+
+ This paper considers the link to the NAG Fortran Library from version
+ 2.0 of Axiom and shows how we can build on this to extend and simplify
+ the interface using an expert system for choosing and using the
+ numerical routines."
+}
+
+\end{chunk}
\index{Adams, Andrew A.}
\index{Dunstan, Martin}
@@ 17214,6 +17341,36 @@ in [Wit87], pp58
year = "1995",
keywords = "axiomref",
paper = "Hawk95.pdf",
+ algebra =
+ "\newline\refto{domain ASP1 Asp1}
+ \newline\refto{domain ASP10 Asp10}
+ \newline\refto{domain ASP12 Asp12}
+ \newline\refto{domain ASP19 Asp19}
+ \newline\refto{domain ASP20 Asp20}
+ \newline\refto{domain ASP24 Asp24}
+ \newline\refto{domain ASP27 Asp27}
+ \newline\refto{domain ASP28 Asp28}
+ \newline\refto{domain ASP29 Asp29}
+ \newline\refto{domain ASP30 Asp30}
+ \newline\refto{domain ASP31 Asp31}
+ \newline\refto{domain ASP33 Asp33}
+ \newline\refto{domain ASP34 Asp34}
+ \newline\refto{domain ASP35 Asp35}
+ \newline\refto{domain ASP4 Asp4}
+ \newline\refto{domain ASP41 Asp41}
+ \newline\refto{domain ASP42 Asp42}
+ \newline\refto{domain ASP49 Asp49}
+ \newline\refto{domain ASP50 Asp50}
+ \newline\refto{domain ASP55 Asp55}
+ \newline\refto{domain ASP6 Asp6}
+ \newline\refto{domain ASP7 Asp7}
+ \newline\refto{domain ASP73 Asp73}
+ \newline\refto{domain ASP74 Asp74}
+ \newline\refto{domain ASP77 Asp77}
+ \newline\refto{domain ASP78 Asp78}
+ \newline\refto{domain ASP8 Asp8}
+ \newline\refto{domain ASP80 Asp80}
+ \newline\refto{domain ASP9 Asp9}",
abstract =
"The 'more' in the title is because this paper is a sequel to papers
by Keving Broughan, [BKRRD,BK]. For some years GK has had interests in
@@ 17242,6 +17399,35 @@ in [Wit87], pp58
}
\end{chunk}
+\index{ASP1}
+\index{ASP10}
+\index{ASP12}
+\index{ASP19}
+\index{ASP20}
+\index{ASP24}
+\index{ASP27}
+\index{ASP28}
+\index{ASP29}
+\index{ASP30}
+\index{ASP31}
+\index{ASP33}
+\index{ASP34}
+\index{ASP35}
+\index{ASP4}
+\index{ASP41}
+\index{ASP42}
+\index{ASP49}
+\index{ASP50}
+\index{ASP55}
+\index{ASP6}
+\index{ASP7}
+\index{ASP73}
+\index{ASP74}
+\index{ASP77}
+\index{ASP78}
+\index{ASP8}
+\index{ASP80}
+\index{ASP9}
\index{Hearn, Anthony C.}
\index{Eberhard, Schrufer}
@@ 18445,6 +18631,7 @@ Draft September 5, 1988
\index{Johansson, Leif}
\index{Lambe, Larry}
\index{Skoldberg, Emil}
+\begin{chunk}{axiom.bib}
@article{Joha02,
author = "Johansson, Leif and Lambe, Larry and Skoldberg, Emil",
title = "On Constructing Resolutions over the Polynomial Algebra",
@@ 18455,7 +18642,7 @@ Draft September 5, 1988
pages = "315336",
keywords = "axiomref",
paper = "Joha02.pdf",
 url = "http://projecteuclid.org/download/pdf_1/euclid.hha/1139852468",
+ url = "http://projecteuclid.org/download/pdf\_1/euclid.hha/1139852468",
abstract =
"Let $k$ be a field, and $A$ be a polynomial algebra over $k$.
Let $I \subseteq A$ be an ideal. We present a novel method for
@@ 18742,7 +18929,7 @@ ISSAC July 2008 ACM 978159593904 pp133140
@inproceedings{Kead93,
author = "Keady, G. and Nolan, G.",
title = "Production of Argument SubPrograms in the AXIOM  NAG link:
 examples involving nonleanr systems",
+ examples involving nonlinear systems",
booktitle = "Proc. Workshop on Symbolic and Numeric Computation",
location = "Helsinki",
year = "1993",
@@ 18751,6 +18938,36 @@ ISSAC July 2008 ACM 978159593904 pp133140
url = "school.maths.uwa.edu.au/%7Ekeady/KeadyPapers/93Helsinki.ps",
paper = "Kead93.pdf",
keywords = "axiomref",
+ algebra =
+ "\newline\refto{domain ASP1 Asp1}
+ \newline\refto{domain ASP10 Asp10}
+ \newline\refto{domain ASP12 Asp12}
+ \newline\refto{domain ASP19 Asp19}
+ \newline\refto{domain ASP20 Asp20}
+ \newline\refto{domain ASP24 Asp24}
+ \newline\refto{domain ASP27 Asp27}
+ \newline\refto{domain ASP28 Asp28}
+ \newline\refto{domain ASP29 Asp29}
+ \newline\refto{domain ASP30 Asp30}
+ \newline\refto{domain ASP31 Asp31}
+ \newline\refto{domain ASP33 Asp33}
+ \newline\refto{domain ASP34 Asp34}
+ \newline\refto{domain ASP35 Asp35}
+ \newline\refto{domain ASP4 Asp4}
+ \newline\refto{domain ASP41 Asp41}
+ \newline\refto{domain ASP42 Asp42}
+ \newline\refto{domain ASP49 Asp49}
+ \newline\refto{domain ASP50 Asp50}
+ \newline\refto{domain ASP55 Asp55}
+ \newline\refto{domain ASP6 Asp6}
+ \newline\refto{domain ASP7 Asp7}
+ \newline\refto{domain ASP73 Asp73}
+ \newline\refto{domain ASP74 Asp74}
+ \newline\refto{domain ASP77 Asp77}
+ \newline\refto{domain ASP78 Asp78}
+ \newline\refto{domain ASP8 Asp8}
+ \newline\refto{domain ASP80 Asp80}
+ \newline\refto{domain ASP9 Asp9}",
abstract =
"Dewar's paper [6] earlier in this Proceedings 'sketches out the
design of the AXIOMNAG link' and gives a general account of new tools
@@ 18761,6 +18978,35 @@ ISSAC July 2008 ACM 978159593904 pp133140
}
\end{chunk}
+\index{ASP1}
+\index{ASP10}
+\index{ASP12}
+\index{ASP19}
+\index{ASP20}
+\index{ASP24}
+\index{ASP27}
+\index{ASP28}
+\index{ASP29}
+\index{ASP30}
+\index{ASP31}
+\index{ASP33}
+\index{ASP34}
+\index{ASP35}
+\index{ASP4}
+\index{ASP41}
+\index{ASP42}
+\index{ASP49}
+\index{ASP50}
+\index{ASP55}
+\index{ASP6}
+\index{ASP7}
+\index{ASP73}
+\index{ASP74}
+\index{ASP77}
+\index{ASP78}
+\index{ASP8}
+\index{ASP80}
+\index{ASP9}
\index{Kelsey, Tom}
\begin{chunk}{ignore}
@@ 19319,7 +19565,8 @@ University of St Andrews, 6th April 2000
title = "Sage Integration Testing",
url = "http://github.com/tjl/sage_int_testing",
year = "2008",
 keywords = "axiomref",
+ keywords = "axiomref"
+}
\end{chunk}
@@ 19327,7 +19574,7 @@ University of St Andrews, 6th April 2000
\index{Pascual, Vico}
\index{Rubio, Julio}
\begin{chunk}{axiom.bib}
@article{Lamb03,
+@article{Lamb03a,
author = "Lamban, Laureano and Pascual, Vico and Rubio, Julio",
title = "An objectoriented interpretation of the EAT system",
journal = "Appl. Algebra Eng. Commun. Comput.",
@@ 19593,6 +19840,43 @@ University of St Andrews, 6th April 2000
\end{chunk}
+\index{Lambe, Larry A.}
+\index{Luczak, Richard}
+\index{Nehrbass, John W.}
+\begin{chunk}{axiom.bib}
+@article{Lamb03,
+ author = "Lambe, Larry A. and Luczak, Richard and Nehrbass, John W.",
+ title = "A New Finite Difference Method for the Helmholtz Equation
+ Using Symbolic Computation",
+ journal = "Int. J. Comp. Eng. Sci.",
+ volume = "4",
+ year = "2003",
+ url = "http://pages.bangor.ac.uk.~mas019/papers/lln.pdf",
+ paper = "Lamb03.pdf",
+ keywords = "axiomref",
+ abstract =
+ "A new finite difference method for the Helmholtz equation is
+ presented. The method involves replacing the standard ``weights'' in the
+ central difference quotients (Secs. 2.1, 2.2, and 2.3) by weights that
+ are optimal in a sense that will be explained in the sections just
+ mentioned. The calculation of the optimal weights involves some
+ complicated and errorprone manipulations of integral formulas that is
+ best done using computeraided symbolic computation (SC). In addition,
+ we discuss the important problem of interpolation involving meshes
+ that have been refined in certain subregions. Analytic formulae are
+ derived using SC for these interpolation schemes. Our results are
+ discussed in Sec. 5. Some hints about the computer methods we used to
+ accomplish these results are given in the Appendix. More information
+ is available and access to that information is referenced.
+
+ While we do not want to make SC the focus of this work, we also do not
+ want to underestimate its value. Armed with robust and efficient SC
+ libraries, a researcher can {\sl comfortably} and {\sl conveniently}
+ experiment with ideas that he or she might not examine otherwise."
+}
+
+\end{chunk}
+
\index{Lazard, Daniel}
\begin{chunk}{axiom.bib}
@InProceedings{Laza93,
@@ 22488,6 +22772,109 @@ LCCN QA76.76.A65 S95 1992
\end{chunk}
+\index{Stauffer, Deitrich}
+\begin{chunk}{axiom.bib}
+@book{Stau95,
+ author = "Stauffer, Deitrich",
+ title = "Annual Review of Computational Physics I",
+ section = "5.2.2",
+ year = "1995",
+ abstract =
+ "Based on our experiences with IRENA, we decided to use generic
+ interprocess communication tools for the link to AXIOM. This has the
+ added advantage that we can operate across a network. The main
+ technique we use is the {\sl Remote Procedure Call} (RPC) [Sun
+ Microsystems Inc., 1988] which allows us to interact with a server on
+ another machine (or on the local machine). RPC takes care of
+ differences in data representation (e.g. the byteorder of floating
+ point numbers) on different architectures.
+
+ AXIOM is a multiprocess package. Normally when a user starts up the
+ system they start up the various components which then interact via
+ standard socket operations. If they are using the line, they start up
+ a new process: the NAG Manager (NAGMAN for short). Additionally, there
+ will be a NAG daemon (NAGD) running on any machine on which the user
+ may wish to execute NAG routines (which could include the local
+ host). NAGMAN commnicates with the running AXIOM system via a socket
+ down which is transmitted the details of and data for the particular
+ routine to be called. NAGMAN calls a NAGD on another machine via RPC
+ and eventually returns the results to AXIOM.
+
+ NAGD consists of the server program, and a set of stub codes designed
+ to call individual NAG routines. It is, in effect, a remotelycallable
+ version of the NAG library. There is no reason why AXIOM should be the
+ only system to use it, and indeed there are plans to incorporate the
+ ability to call NAGD into other systems.
+
+ An ASP is treated just like any other piece of data by the AXIOMNAG
+ link. The source code is passed to NAGD and compiled. (There are
+ various optimisations to prevent the same code being compiled multiple
+ times, but the details needn't concern us here.) This compiled code is
+ linked with the NAG Library to make the executable. Thus if a user
+ calls the same NAG routine with different ASPs the routine will be
+ relinked each time.
+
+ It would be nice if this were not necessary. The authors of the link
+ considered two other possibilities:
+ \begin{itemize}
+ \item Have AXIOM simulate the ASPs, so that the NAG Library would call
+ back to AXIOM when it wanted to call an ASP. This was rejected as
+ being far too slow across a network.
+ \item Give NAGD the ability to interpret AXIOM or Fortran code. Thus
+ the NAG routine would call a function which would evaluate a
+ representation of an ASP to get the required values. This may happen
+ in the future if data interchange mechanisms between systems are
+ stanardised, but was rejected for the time being since such a system
+ would have to be tailored to match each Fortran compiler that NAGD used.
+ \end{itemize}
+
+ By transmitting source code for ASPs we allow the remote Fortran
+ compiler to take care of lowlevel portability problems.
+
+ Both IRENA and the AXIOMNAG Link make using the NAG Library easier in
+ a functional kind of way. They present a more natural, interactive
+ interface and, what is more, they cut out some of the tedium of
+ writing code by generating values for some parameters (array
+ dimensions etc.) and computing derivatives and
+ jacobians. Unfortunately the user still has to choose which algorithm
+ to use, and tuen the control parameters to give a result of the
+ required accuracy.
+
+ This is not a trivial task. The NAG Library has some thirty quadrature
+ routines, and maby forty toplevel ODEsolving routines. The criteria
+ for selecting a routine can include features of the problem such as
+ whether a function is continuous, or they can include requrements from
+ the user such as whether speed or accuracy is important. The user
+ should also think carefully about whether the problem is being
+ presentin in the best way: perhaps an integral can be solved more
+ easily if the range of integration is split into several pieces for
+ example.
+
+ Many users of numerical software would like to be presented with a
+ ``black box'' for solving a given class of problems. In practice many
+ users will always try solving a problem with the ``simplest'' method
+ first, in the hope that they can escape having to think seriously
+ about their problem! This is not always a bad idea anyway, since the
+ feedback from the routine can help determine a better technique
+ (e.g. by identifying the regions where problems occur).
+
+ We contend that computer algebra has an important role to play in this
+ area. The ability of algebra systems to analyse the symbolic features
+ of a problem make them idea {\sl agents} for knowledgebased (or
+ expert) systems to use in selecting routines. Their ability (via IRENA
+ or AXIOMNAG) to drive the numerical codes is a bonus.
+
+ Writing such packages is not easy. Some problem attributes are easy to
+ determin (e.g {\sl is a matrix symmetric?} or {\sl is a region
+ finite?}), but some are very hard and may in fact be in general
+ undecidable without human intervention. Even if a tecnique exists to
+ determine a particular attribute it may be too slow to use in
+ practice. Then, once we have these pieces of information, we need a
+ mechanism to allow us to reason with them effectively."
+}
+
+\end{chunk}
+
\index{Steele, Guy L.}
\index{Gabriel, Richard P.}
\begin{chunk}{ignore}
diff git a/changelog b/changelog
index b2dab7b..e4179ec 100644
 a/changelog
+++ b/changelog
@@ 1,3 +1,7 @@
+20160710 tpd src/axiomwebsite/patches.html 20160710.01.tpd.patch
+20160710 tpd books/bookvol10.4 reference Dupe99
+20160710 tpd books/bookvol10.3 reference Hawk95 and Kead93
+20160710 tpd books/bookvolbib Axiom Citations in the Literature
20160709 tpd src/axiomwebsite/patches.html 20160709.01.tpd.patch
20160709 tpd books/bookvolbib Axiom Citations in the Literature
20160708 tpd src/axiomwebsite/patches.html 20160708.01.tpd.patch
diff git a/patch b/patch
index f63f2be..fa8281d 100644
 a/patch
+++ b/patch
@@ 2,239 +2,240 @@ books/bookvolbib Axiom Citations in the Literature
Goal: Axiom Literate Programming
\index{Melachrinoudis, E.}
\index{Rumpf, D. L.}
+\index{Hawkes, Evatt}
+\index{Keady, Grant}
\begin{chunk}{axiom.bib}
@article{Mela90,
 author = "Melachrinoudis, E.; Rumpf, D. L.",
 title = "Teaching advantages of transparent computer software  MathCAD",
 journal = "CoED",
 volume = "10",
 number = "1",
 pages = "7176",
 year = "1990",
+@inproceedings{Hawk95,
+ author = "Hawkes, Evatt and Keady, Grant",
+ title = "Two more links to NAG numerics involving CA systems",
+ booktitle = "IMACS Applied Computer Algebra Conference",
+ location = "University of New Mexico",
+ year = "1995",
keywords = "axiomref",
+ paper = "Hawk95.pdf",
+ algebra =
+ "\newline\refto{domain ASP1 Asp1}
+ \newline\refto{domain ASP10 Asp10}
+ \newline\refto{domain ASP12 Asp12}
+ \newline\refto{domain ASP19 Asp19}
+ \newline\refto{domain ASP20 Asp20}
+ \newline\refto{domain ASP24 Asp24}
+ \newline\refto{domain ASP27 Asp27}
+ \newline\refto{domain ASP28 Asp28}
+ \newline\refto{domain ASP29 Asp29}
+ \newline\refto{domain ASP30 Asp30}
+ \newline\refto{domain ASP31 Asp31}
+ \newline\refto{domain ASP33 Asp33}
+ \newline\refto{domain ASP34 Asp34}
+ \newline\refto{domain ASP35 Asp35}
+ \newline\refto{domain ASP4 Asp4}
+ \newline\refto{domain ASP41 Asp41}
+ \newline\refto{domain ASP42 Asp42}
+ \newline\refto{domain ASP49 Asp49}
+ \newline\refto{domain ASP50 Asp50}
+ \newline\refto{domain ASP55 Asp55}
+ \newline\refto{domain ASP6 Asp6}
+ \newline\refto{domain ASP7 Asp7}
+ \newline\refto{domain ASP73 Asp73}
+ \newline\refto{domain ASP74 Asp74}
+ \newline\refto{domain ASP77 Asp77}
+ \newline\refto{domain ASP78 Asp78}
+ \newline\refto{domain ASP8 Asp8}
+ \newline\refto{domain ASP80 Asp80}
+ \newline\refto{domain ASP9 Asp9}",
abstract =
 "The case is presented for using mathematical scratchpad software,
 such as MathCAD, in undergraduate and graduate engineering
 courses. The pedagogical benefits, especially relative to the usual
 black box engineering software, are described. Several examples of
 student written projects are presented. The projects solve problems in
 operations research, control theory and statistical regression
 analysis."
}

\end{chunk}

\index{Augot, D.}
\index{Charpin, P.}
\index{Sendrier, N.}
\begin{chunk}{axiom.bib}
@inproceedings{Augo91,
 author = "Augot, D. and Charpin, P. and Sendrier, N.",
 title = "The miniumum distance of some binary codes via the
 Newton's identities",
 booktitle = "Int. Symp. on Coding Theory and Applications",
 year = "1991",
 pages = "6573",
 isbn = "0387543031",
 keywords = "axiomref",
 paper = "Augo91.pdf",
 abstract =
 "In this paper, we give a natural way of deciding whether a given
 cyclic code contains a word of given weight. The method is based on
 the manipulation of the locators and of the locator polynomial of a
 codeword $x$.

 Because of the dimensions of the problem, we need to use a symbolic
 computation software, like Maple or Scratchpad II. The method can be
 ineffective when the length is too large.
+ "The 'more' in the title is because this paper is a sequel to papers
+ by Keving Broughan, [BKRRD,BK]. For some years GK has had interests in
+ (i) interactive frontends to numeric computation, such as the
+ NAG/IMSL library computation, and (ii) Fortran code generation for
+ Argument SubPrograms (ASPs), such as those neede by some NAG/IMSL
+ routines. Demonstrations of three links to the NAG library are
+ described in [BKRRD]. A description of a link to NAG from Macsyma
+ which was mentioned, but not in a sufficiently advanced state to
+ demonstrate in early 1991, is given in [BK]. The situation at the end
+ of 1991 was that there were links to NAG involving each of Macsyma,
+ REDUCE and Mathematica. The links are called Naglink, IRENA and
+ InterCall, respectively. The principal authors of IRENA are Mike Dewar
+ and Mike Richardson. InterCall is not specific to the NAG library;
+ indeed InterCall is used with calls to IMSL and to elsewhere at the
+ conference venue, the University of New Mexico.
 The paper contains two parts: In the first part we will present the main
 definitions and properties we need.

 In the second part, we will explain how to use these properties, and, as
 illustration, we will prove the following facts:
 \begin{itemize}
 \item The dual of the BCH code of length 63 and designed distance 9
 has true minimum distance 14 (which was already known).
 \item The BCH code of length 1023 and designed distance of 253 has
 minimum distance 253.
 \item The cyclic codes of length $2^111$, $2^131$, $2^171$, with
 generator polynomial $m_1(x)$ and $m_7(x)$ have minimum distance 4.
 \end{itemize}"
}
+ The two futher links to NAG library treated in this paper are AXIOM2.0
+ and genmex/ESC, genmex allows calls to NAG from Matlab. genmex can be
+ regarded as similar to InterCall: genmes uses Matlab's mex files in a
+ similar way to InterCall's use of Mathematica's MathLink. Again genmex
+ is not specific to the NAG library. Mike Dewar is an author both of
+ IRENA and the AXIOM2.0 link to the NAG library: see [D] foe discussion
+ of the differences between the IRENA project and the AXIOMNAG link
+ project."
+}
\end{chunk}
\index{Goodwin, B. M.}
\index{Buonopane, R. A.}
\index{Lee, A.}
+\index{Keady, G.}
+\index{Nolan, G.}
\begin{chunk}{axiom.bib}
@inproceedings{Good91,
 author = "Goodwin, B. M. and Buonopane, R. A. and Lee, A.",
 title = "Using MathCAD in teaching material and energy balance concepts",
 booktitle = "Challenges of a Changing World",
 comment = "Proc. 1991 Ann. Conf., Amer. Soc. for Engineering Education",
 pages = "345349",
 year = "1991",
+@inproceedings{Kead93,
+ author = "Keady, G. and Nolan, G.",
+ title = "Production of Argument SubPrograms in the AXIOM  NAG link:
+ examples involving nonlinear systems",
+ booktitle = "Proc. Workshop on Symbolic and Numeric Computation",
+ location = "Helsinki",
+ year = "1993",
+ pages = "1332",
+ comment = "NAG Technical Report TR1/94",
+ url = "school.maths.uwa.edu.au/%7Ekeady/KeadyPapers/93Helsinki.ps",
+ paper = "Kead93.pdf",
keywords = "axiomref",
+ algebra =
+ "\newline\refto{domain ASP1 Asp1}
+ \newline\refto{domain ASP10 Asp10}
+ \newline\refto{domain ASP12 Asp12}
+ \newline\refto{domain ASP19 Asp19}
+ \newline\refto{domain ASP20 Asp20}
+ \newline\refto{domain ASP24 Asp24}
+ \newline\refto{domain ASP27 Asp27}
+ \newline\refto{domain ASP28 Asp28}
+ \newline\refto{domain ASP29 Asp29}
+ \newline\refto{domain ASP30 Asp30}
+ \newline\refto{domain ASP31 Asp31}
+ \newline\refto{domain ASP33 Asp33}
+ \newline\refto{domain ASP34 Asp34}
+ \newline\refto{domain ASP35 Asp35}
+ \newline\refto{domain ASP4 Asp4}
+ \newline\refto{domain ASP41 Asp41}
+ \newline\refto{domain ASP42 Asp42}
+ \newline\refto{domain ASP49 Asp49}
+ \newline\refto{domain ASP50 Asp50}
+ \newline\refto{domain ASP55 Asp55}
+ \newline\refto{domain ASP6 Asp6}
+ \newline\refto{domain ASP7 Asp7}
+ \newline\refto{domain ASP73 Asp73}
+ \newline\refto{domain ASP74 Asp74}
+ \newline\refto{domain ASP77 Asp77}
+ \newline\refto{domain ASP78 Asp78}
+ \newline\refto{domain ASP8 Asp8}
+ \newline\refto{domain ASP80 Asp80}
+ \newline\refto{domain ASP9 Asp9}",
abstract =
 "We show how PCbased applications software, specifically MathCAD, is
 used in the teaching of material and energy balance concepts. MathCAD
 is a microcomputer software package which acts as a mathematical
 scratchpad. It has proven to be a very useful instructional tool in
 introductory chemical engineering courses. MathCAD solutions to
 typical course problems are presented."
+ "Dewar's paper [6] earlier in this Proceedings 'sketches out the
+ design of the AXIOMNAG link' and gives a general account of new tools
+ for generating Fortran. This paper is a sequel to [6]. Here we present
+ 'examples' of some of the items discussed in [6]. We have attempted to
+ achieve some coherence by selecting our 'examples' from just the one
+ application area  solving nonlinear systems."
}
\end{chunk}
\index{Grabmeier, Johannes}
\index{Huber, K.}
\index{Krieger, U.}
+\index{Fateman, Richard J.}
+\index{Einwohner, Theodore H.}
\begin{chunk}{axiom.bib}
@techreport{Grab91,
 author = "Grabmeier, Johannes and Huber, K. and Krieger, U.",
 title = "Das ComputeralgebraSystem AXIOM bei kryptologischen und
 verkehrstheoretischen Untersuchungen des Forschunginstituts
 der Deutschen Bundespost TELEKOM'",
 type = "technical report",
 number = "TR 75.91.20",
 location = "Heidelberg, Germany",
 year = "1991",
 keywords = "axiomref"
+@misc{Fate92,
+ author = "Fateman, Richard J. and Einwohner, Theodore H.",
+ title = "A Proposal for Automated Integral Tables (Work in Progress)",
+ year = "1992",
+ url = "http://people.eecs.berkeley.edu/~fateman/papers/intable.pdf",
+ paper = "Fate92.pdf",
+ abstract =
+"One of the longterm general goals of algebraic manipulation systems
+has been the automation of difficult or tedious, yet common, symbolic
+mathematical operations. Prominent amount these has been symbolic
+integration. Although some effective algorithms have been devised for
+integration expecially for those problems solvable in terms of
+elementary functions and a few additional special functions, the vast
+majority of entires in large tables of indefinite and definite
+integrals remain out of reach of current machine algorithms. We
+propose techniques for introducing the information in such tables to
+computers, extending such tables, and measuring the success of such
+automation.
+
+Similar tabular data concerning simplifications, summation identities,
+and similar formulas could also be treated by some of the same
+techniques."
}
\end{chunk}
\index{Koseleff, P.V.}
+\index{Dewar, Michael C.}
\begin{chunk}{axiom.bib}
@article{Kosl91,
 author = "Koseleff, P.V.",
 title = "Word games in free Lie algebras: several bases and formulas",
 journal = "Theoretical Computer Science",
 volume = "79",
 number = "1",
 pages = "241256",
+@phdthesis{Dewa91,
+ author = "Dewar, Michael C.",
+ title = "Interfacing algebraic and numeric computation",
year = "1991",
 keywords = "axiomref",
 abstract =
 "The author compares the efficiency of many methods which allow
 calculations in Lie algebras. Many construction methods exist for the
 base of free Lie algebras developed from finite sets. They use two
 algorithms for calculation of several CampbellHausdorf formulas.
 Diverse implementations are realised in LISP on Scratchpad II"
+ institution = "University of Bath, UK, England"
}
\end{chunk}
\index{Lambe, Larry A.}
+\index{Dupee, Brian J.}
+\index{Davenport, James H.}
\begin{chunk}{axiom.bib}
@article{Lamb91,
 author = "Lambe, Larry A.",
 title = "Resolutions via homological perturbation",
 journal = "Journal of Symbolic Computation",
 volume = "12",
 number = "1",
 pages = "7187",
 year = "1991",
+@misc{Dupe99,
+ author = "Dupee, Brian J. and Davenport, James H.",
+ title = "An Automatic SymbolicNumeric Taylor Series ODE Solver",
+ year = "1999",
+ paper = "Dupe99.pdf",
+ url = "http://people.eecs.berkeley.edu/~fateman/papers/casc9934.pdf",
keywords = "axiomref",
 paper = "Lamb91.pdf",
 abstract =
 "The purpose of this paper is to review an algorithm for computing
 ``small'' resolutions in homological algebra, to provide examples of
 its use as promised in [L1], [LS], and to illustrate the use of
 computer algebra in an area not usually associated with that
 subject. Comparison of the complexes produced by the method discussed
 here with those produced by other methods shows that the algorithm
 generalizes several other approaches, [GL], [GLS1], [GLS2], [BL], [BL2].
+ algebra = "\newline\refto{package EXPRODE ExpressionSpaceODESolver}",
+ abstract =
+ "One of the basic techniques in every mathematician's toolkit is the
+ Taylor series representation of functions. It is of such fundamental
+ importance and it is so well understood that its use is often a first
+ choice in numerical analysis. This faith has not, unfortunately, been
+ transferred to the design of computer algorithms.
 This is an expository note which is intended to help make homological
 perturbation theory more accesible and to encourage wider use of
 Computer Algebra in mathematical research.
+ Approximation by use of Taylor series methods is inherently partly a
+ symbolic process and partly numeric> This aspect has often, with
+ reason, been regared as a major hindrance in algorithm design. Whilst
+ attempts have been made in the past to build a consistent set of
+ programs for the symbolic and numeric paradigms, these have been
+ necessarily multistage processes.
 The class of objects presented here  Finitely generated torsionfree
 nilpotent groups (of arbitrary nilpotency class)  are given because
 of their simplicity. The examples point to the general phenomena that
 are to be expected when trying to derive complexes smaller than
 ``standard complexes'' in other homological contexts. The complexes
 produced are generally {\sl much} smaller than the bar construction, but
 larger than a {\sl minimal resolution}."
+ Using current technology it has at last become possible to integrate
+ these two concepts and build an automatic adaptive symbolicnumeric
+ algorithm within a uniform framework which can hide the internal
+ workings behind a modern interface."
}
\end{chunk}
+\index{ExpressionSpaceODESolver}
\index{Johansson, Leif}
\index{Lambe, Larry}
\index{Skoldberg, Emil}
@article{Joha02,
 author = "Johansson, Leif and Lambe, Larry and Skoldberg, Emil",
 title = "On Constructing Resolutions over the Polynomial Algebra",
 journal = "Homology, Homotopy and Applications",
 volume = "4",
 number = "2",
 year = "2002",
 pages = "315336",
 keywords = "axiomref",
 paper = "Joha02.pdf",
 url = "http://projecteuclid.org/download/pdf_1/euclid.hha/1139852468",
 abstract =
 "Let $k$ be a field, and $A$ be a polynomial algebra over $k$.
 Let $I \subseteq A$ be an ideal. We present a novel method for
 computing resolutions of $A/I$ over $A$. The method is a synthesis
 of Groebner basis techniques and homological perturbation theory.
 The examples in this paper were computed using computer algebra."
}

\end {chunk}

\index{Boyle, Ann}
\index{Caviness, B.F.}
\index{Hearn, Anthony C.}
\begin{chunk}{axiom.bib}
@misc{Boyl88,
 author = "Boyle, Ann and Caviness, B.F. and Hearn, Anthony C.",
 title = "Future Directions for Research in Symbolic Computation",
 publisher = "Soc. for Industrial and Applied Mathematics",
 year = "1988"
 url = "http://www.eecis.udel.edu/~caviness/wsreport.pdf",
 paper = "Boyl88.pdf",
 keywords = "axiomref"
}

\end{chunk}

\index{Kocbach, Ladislav}
\index{Liska, Richard}
+\index{Lambe, Larry A.}
+\index{Luczak, Richard}
+\index{Nehrbass, John W.}
\begin{chunk}{axiom.bib}
@article{Kocb96,
 author = "Kocbach, Ladislav and Liska, Richard",
 title = "Generation and Verification of Algorithms for Symbolic_Numeric
 Processing",
 journal = "J. Symbolic Computation",
 volume = "11",
 pages = "116",
 year = "1996",
+@article{Lamb03,
+ author = "Lambe, Larry A. and Luczak, Richard and Nehrbass, John W.",
+ title = "A New Finite Difference Method for the Helmholtz Equation
+ Using Symbolic Computation",
+ journal = "Int. J. Comp. Eng. Sci.",
+ volume = "4",
+ year = "2003",
+ url = "http://pages.bangor.ac.uk.~mas019/papers/lln.pdf",
+ paper = "Lamb03.pdf"
keywords = "axiomref",
 paper = "Kocb96.pdf",
 abstract =
 "Some large scale physical computations require algorithms performing
 symbolic computations with a particular class of algebraic formulas in
 a numerical code. Developing and implementing such algorithms in a
 numerical programming language is a tedious and error prone task. The
 algorithms can be developed in a computer algebra system and their
 correctness can be checked by comparison with builtin facilities of
 the system so that the system is used as an advanced debugging
 tool. After that a numerical code for the algorithms is automatically
 generated from the same source code. The proposed methodolgy is
 explained in detail on a simple example. Real applications to
 calculation of matrix elements of Coulomb interaction and twocentre
 exchange integrals needed in atomic collision codes, are
 described. The method makes the developing and debugging of such
 algorithms easier and faster."
+ abstract =
+ "A new finite difference method for the Helmholtz equation is
+ presented. The method involves replacing the standard ``weights'' in the
+ central difference quotients (Secs. 2.1, 2.2, and 2.3) by weights that
+ are optimal in a sense that will be explained in the sections just
+ mentioned. The calculation of the optimal weights involves some
+ complicated and errorprone manipulations of integral formulas that is
+ best done using computeraided symbolic computation (SC). In addition,
+ we discuss the important problem of interpolation involving meshes
+ that have been refined in certain subregions. Analytic formulae are
+ derived using SC for these interpolation schemes. Our results are
+ discussed in Sec. 5. Some hints about the computer methods we used to
+ accomplish these results are given in the Appendix. More information
+ is available and access to that information is referenced.
+
+ While we do not want to make SC the focus of this work, we also do not
+ want to underestimate its value. Armed with robust and efficient SC
+ libraries, a researcher can {\sl comfortably} and {\sl conveniently}
+ experiment with ideas that he or she might not examine otherwise."
}
\end{chunk}

diff git a/src/axiomwebsite/patches.html b/src/axiomwebsite/patches.html
index b6cb6cf..358d4df 100644
 a/src/axiomwebsite/patches.html
+++ b/src/axiomwebsite/patches.html
@@ 5464,6 +5464,8 @@ books/bookvolbib Axiom Citations in the Literature
books/bookvolbib Axiom Citations in the Literature
20160709.01.tpd.patch
books/bookvolbib Axiom Citations in the Literature
+20160710.01.tpd.patch
+books/bookvolbib Axiom Citations in the Literature

1.7.5.4