From 6a1b8ce7b43612097a7f5472bef3e0b24e035c22 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sat, 25 Jun 2016 23:54:52 0400
Subject: [PATCH] books/bookvol10.4 add Rube06, Hebi10 GUESS references
Goal: Axiom Literate Programming

books/bookvol10.4.pamphlet  36 ++++++
changelog  2 +
patch  232 +
src/axiomwebsite/patches.html  2 +
4 files changed, 41 insertions(+), 231 deletions()
diff git a/books/bookvol10.4.pamphlet b/books/bookvol10.4.pamphlet
index c44c4e9..9ca1867 100644
 a/books/bookvol10.4.pamphlet
+++ b/books/bookvol10.4.pamphlet
@@ 75264,9 +75264,15 @@ o )show Guess
The original code would not compile. This is a temporary replacement
with changes marked with my initials. I will pick up the latest
version sometime in the future and hope it compiles. (Tim Daly)
+
+See: Rubey\cite{Rube06}, Hebisch\cite{Hebi10}
+\label{package GUESS Guess}
\begin{chunk}{package GUESS Guess}
)abbrev package GUESS Guess
++ Author: Martin Rubey, Timothy Daly
+++ References:
+++ Rube06 Extended rate, more GFUN
+++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package implements guessing of sequences. Packages for the
++ most common cases are provided as \spadtype{GuessInteger},
@@ 77056,8 +77062,13 @@ o )show GuessAlgebraicNumber
\cross{GUESSAN}{shiftHP} &&
\end{tabular}
+See Rubey\cite{Rube06}, Hebisch\cite{Hebi10}
+\label{package GUESSAN GuessAlgebraicNumber}
\begin{chunk}{package GUESSAN GuessAlgebraicNumber}
)abbrev package GUESSAN GuessAlgebraicNumber
+++ References:
+++ Rube06 Extended rate, more GFUN
+++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package exports guessing of sequences of rational functions
@@ 77171,8 +77182,13 @@ o )show GuessFinite
\cross{GUESSF}{shiftHP} &&
\end{tabular}
+See: Rubey\cite{Rube06}, Hebisch\cite{Hebi10}
+\label{package GUESSF GuessFinite}
\begin{chunk}{package GUESSF GuessFinite}
)abbrev package GUESSF GuessFinite
+++ References:
+++ Rube06 Extended rate, more GFUN
+++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package exports guessing of sequences of numbers in a finite field
@@ 77238,8 +77254,13 @@ o )show GuessFiniteFunctions
{\bf Exports:}\\
\cross{GUESSF1}{F2EXPRR}
+See: Rubey\cite{Rube06}, Hebisch\cite{Hebi10}
+\label{package GUESSF1 GuessFiniteFunctions}
\begin{chunk}{package GUESSF1 GuessFiniteFunctions}
)abbrev package GUESSF1 GuessFiniteFunctions
+++ References:
+++ Rube06 Extended rate, more GFUN
+++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package exports guessing of sequences of numbers in a finite field
@@ 77360,10 +77381,15 @@ o )show GuessInteger
\cross{GUESSINT}{shiftHP} &&
\end{tabular}
+See Rubey\cite{Rube06}, Hebisch\cite{Hebi10}
+\label{package GUESSINT GuessInteger}
\begin{chunk}{package GUESSINT GuessInteger}
 concerning algebraic functions, it may make sense to look at A.J.van der
 Poorten, Power Series Representing Algebraic Functions, Section 6.
)abbrev package GUESSINT GuessInteger
+++ References:
+++ Rube06 Extended rate, more GFUN
+++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package exports guessing of sequences of rational numbers
@@ 77476,8 +77502,13 @@ o )show GuessPolynomial
\cross{GUESSP}{shiftHP} &&
\end{tabular}
+See: Rubey\cite{Rube06}, Hebisch\cite{Hebi10}
+\label{package GUESSP GuessPolynomial}
\begin{chunk}{package GUESSP GuessPolynomial}
)abbrev package GUESSP GuessPolynomial
+++ References:
+++ Rube06 Extended rate, more GFUN
+++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package exports guessing of sequences of rational functions
@@ 77591,8 +77622,13 @@ o )show GuessUnivariatePolynomial
\cross{GUESSUP}{shiftHP} &&
\end{tabular}
+See: Rubey\cite{Rube06}, Hebisch\cite{Hebi10}
+\label{package GUESSUP GuessUnivariatePolynomial}
\begin{chunk}{package GUESSUP GuessUnivariatePolynomial}
)abbrev package GUESSUP GuessUnivariatePolynomial
+++ References:
+++ Rube06 Extended rate, more GFUN
+++ Hebi10 Extended Rate, more GFUN
++ Description:
++ This package exports guessing of sequences of univariate rational functions
diff git a/changelog b/changelog
index c8a9ef2..80454d5 100644
 a/changelog
+++ b/changelog
@@ 1,3 +1,5 @@
+20160625 tpd src/axiomwebsite/patches.html 20160625.08.tpd.patch
+20160625 tpd books/bookvol10.4 add Rube06, Hebi10 GUESS references
20160625 tpd src/axiomwebsite/patches.html 20160625.07.tpd.patch
20160625 tpd books/bookvolbib Axiom Citations in the Literature
20160625 tpd src/axiomwebsite/patches.html 20160625.06.tpd.patch
diff git a/patch b/patch
index 7c915ab..b646beb 100644
 a/patch
+++ b/patch
@@ 1,234 +1,4 @@
books/bookvolbib Axiom Citations in the Literature
+books/bookvol10.4 add Rube06, Hebi10 GUESS references
Goal: Axiom Literate Programming
\index{Carette, Jacques}
\begin{chunk}{axiom.bib}
@article{Care06,
 author = "Carette, Jacques",
 title = "Gaussian elimination: a case study in efficient genericity
 with MetaOCaml",
 journal = "Sci. Comput. Program.",
 volume = "62",
 number = "1",
 pages = "324",
 year = "2006",
 keywords = "axiomref",
 url = "http://www.cas.mcmaster.ca/~carette/publications/ge.pdf",
 paper = "Care06.pdf",
 abstract =
 "The Gaussian Elimination algorithm is in fact an algorithm family –
 common implementations contain at least six (mostly independent)
 ``design choices''. A generic implementation can easily be parametrized
 by all these design choices, but this usually leads to slow and
 bloated code. Using MetaOCaml’s staging facilities, we show how we can
 produce a natural and typesafe implementation of Gaussian Elimination
 which exposes its design choices at codegeneration time, so that
 these choices can effectively be specialized away, and where the
 resulting code is quite efficient."
}

\end{chunk}

\index{Li, Xin}
\begin{chunk}{axiom.bib}
@phdthesis{Lixx05,
 author = "Li, Xin",
 title = "Efficient Management of Symbolic Computation with Polynomials",
 school = "University of Western Ontario",
 year = "2005",
 paper = "Lixx05.pdf",
 keywords = "axiomref",
 url =
 "http://www.csd.uwo.ca/~moreno//Publications/XinLiMSThesis2005.pdf.gz",
 abstract =
 "Symbolic polynomial computation is widely used to solve many applied
 or abstract mathematical problems. Some of them, such as solving
 systems of polynomial equations, have exponential complexity. Their
 implementation is, therefore, a challenging task.

 By using adapted data structures, asymptotically fast algorithms and
 effective code optimization techniques, we show how to reduce the
 practical and theoretical complexity of these computations. Our effort
 is divided into three categories: integrting the best known techniques
 into our implementation, investigating new directions, and measuring
 the interactions between numerous techniques.

 We chose AXIOM and ALDOR as our implementation and experimentation
 environment, since they are both strongly typed and highly efficient
 Computer Algebra Systems (CAS). Our implementation results show that
 our methods have great potential to improve the efficiency of exact
 polynomial computations with the selected CASs. The performance of our
 implementation is comparable to that of (often outperforming) the best
 available packages for polynomial computations."
}

\end{chunk}

\index{Li, Xin}
\begin{chunk}{axiom.bib}
@phdthesis{Lixx09a,
 author = "Li, Xin",
 title = "Toward HighPerformance Polynomial System Solvers Based On
 Triangluar Decompositions",
 school = "University of Western Ontario",
 year = "2009",
 paper = "Lixx09a.pdf",
 keywords = "axiomref",
 url = "http://www.csd.uwo.ca/~moreno/Publications/XinLiPhDThesis2008.pdf",
 abstract =
 "This thesis is devoted to the design and implementation of polynomial
 system solvers based on symbolic computation. Solving systems of
 nonlinear, algebraic or differential equations, is a fundamental
 problem in mathematical sciences. It has been studied for centuries
 and still stimulates many research developments, in particular on the
 front of highperformance computing.

 Triangular decompositions are a highly promising technique with the
 potential to produce highperformance polynomial system solvers. This
 thesis makes several contributions to this effort.

 We propose asymptotically fast algorithms for the core operati ons on
 which triangular decompositions rely. Complexity results and comparati
 ve implementation show that these new algorithms provide substantial
 performance improvements.

 We present a fundamental software library for polynomial arithmetic in
 order to support the implementation of highperformance solvers based
 on triangular decompositions. We investigate strategies for the
 integration of this library in highlevel programming environments
 where triangular decompositions are usually implemented.

 We obtain a high performance library combining highly optimized C
 routines and solving procedures written in the Maple computer algebra
 system. The experimental result shows that our approaches are very
 effective, since our code often outperforms preexisting solvers in a
 significant manner."
}

\end{chunk}

\index{Li, Xin}
\index{Moreno Maza, Marc}
\begin{chunk}{axiom.bib}
@InProceedings{{Lixx06,
 author = "Li, Xin and Moreno Maza, Marc",
 title = "Efficient implementation of polynomial arithmetic in a
 multiplelevel programming environment",
 booktitle = "Mathematical Software",
 series = "ICMS 2006",
 year = "2006",
 isbn = "9783540380849",
 location = "Spain",
 pages = "1223",
 keywords = "axiomref",
 paper = "Lixx06.pdf",
 url = "http://www.math.kobeu.ac.jp/icms2006/icms2006video/slides/046.pdf",
 abstract =
 "The purpose of this study is to investigate implementation techniques
 for polynomial arithmetic in a multiplelevel programming
 environment. Indeed, certain polynomial data types and algorithms can
 further take advantage of the features of lower level languages, such
 as their specialized data structures or direct access to machine
 arithmetic. Whereas, other polynomial operations, like Groebner basis
 over an arbitrary field, are suitable for generic programming in a
 highlevel language.

 We are interested in the integration of polynomial data type
 implementations realized at different language levels, such as Lisp, C
 and Assembly. In particular, we consider situations for which code
 from different levels can be combined together within the same
 application in order to achieve highperformance. We have developed
 implementation techniques in the multiplelevel programming
 environment provided by the computer algebra system AXIOM. For a given
 algorithm realizing a polynomial operation, available at the user
 level, we combine the strengths of each language level and the
 features of a specific machine architecture. Our experimentations show
 that this allows us to improve performances of this operation in a
 significant manner."
}

\end{chunk}

\index{Rubey, Martin}
\begin{chunk}{axiom.bib}
@InProceedings{Rube06,
 author = "Rubey, Martin",
 title = "Extented rate, more GFUN",
 booktitle = "4th Colloquium on mathematics and computer science",
 series = "DMTCS",
 year = "2006",
 location = "Nancy, France",
 pages = "431434",
 paper = "Rube06.pdf",
 url = "http://mathinfo06.iecn.unancy.fr/papers/dmAG431434.pdf",
 abstract =
 "We present a software package that guesses formulas from sequences
 of, for example, rational numbers or rational functions, given the
 first few terms. Thereby we extend and complement C. Krattenthaler's
 program RATE [RATE: a Mathematics guessing machine] and the relevant
 parts of B. Salvy and P. Zimmermann's GFUN."
}

\end{chunk}

\index{Hebisch, Waldemar}
\index{Rubey, Martin}
\begin{chunk}{axiom.bib}
@article{Hebi10,
 author = "Hebisch, Waldemar and Rubey, Martin",
 title = "Extended Rate, more GFUN",
 year = "2010",
 url = "https://arxiv.org/abs/math/0702086v2",
 paper = "Hebi10.pdf",
 comment = "\newline\refto{package GUESS Guess}
 \newline\refto{package GUESSAN GuessAlgebraicNumber}
 \newline\refto{package GUESSF GuessFinite}
 \newline\refto{package GUESSF1 GuessFiniteFunctions}
 \newline\refto{package GUESSINT GuessInteger}
 \newline\refto{package GUESSP GuessPolynomial}
 \newline\refto{package GUESSUP GuessUnivariatePolynomial}",
 abstract =
 "We present a software package that guesses formulae for sequences of,
 for example, rational numbers or rational functions, given the first
 few terms. We implement an algorithm due to Bernhard Beckermann and
 George Labahn, together with some enhancements to render our package
 efficient. Thus we extend and complement Christian Krattenthaler's
 program Rate, the parts concerned with guessing of Bruno Salvy and
 Paul Zimmermann's GFUN, the univariate case of Manuel Kauers' Guess.m
 and Manuel Kauers' and Christoph Koutschan's qGeneratingFunctions.m."
}

\end{chunk}

\index{Fortuna, E.}
\index{Gianni, P.}
\index{Luminati, D.}
\index{Parenti, P.}
\begin{chunk}{axiom.bib}
@article{Fort05,
 author = "Fortuna, E. and Gianni, P. and Luminati, D. and Parenti, P.",
 title = "The adjacency graph of a real algebraic surface",
 journal = "Appl. Algebra Eng. Commun. Comput.",
 volume = "16",
 number = "5",
 pages = "271292",
 year = "2005",
 keywords = "axiomref",
 url = "http://eprints.biblio.unitn.it/788/1/UTM671.pdf",
 paper = "Fort05.pdf",
 abstract =
 "The paper deals with the question of recognizing the mutual positions
 of the connected components of a nonsingular real projective surface
 $S$ in the real projective 3space. We present an algorithm that
 answers this question through the computation of the adjacency graph
 of the surface; it also allows to decide whether each connected
 component is contractible or not. The algorithm, combined with a
 previous one returning as an output the topology of the surface,
 computes a set of data invariant up to ambienthomeomorphism which,
 though not sufficient to determine the pair $(\mathbb{R}\mathbb{P}^3,S)$,
 give information about the nature of the surface as an embedded object."
}

\end{chunk}

diff git a/src/axiomwebsite/patches.html b/src/axiomwebsite/patches.html
index c78e6ca..1e051cb 100644
 a/src/axiomwebsite/patches.html
+++ b/src/axiomwebsite/patches.html
@@ 5390,6 +5390,8 @@ books/bookvol9 add Spad BNF syntax from Smit07
books/bookvol* standardize the bibliography/index sections
20160625.07.tpd.patch
books/bookvolbib Axiom Citations in the Literature
+20160625.08.tpd.patch
+books/bookvol10.4 add Rube06, Hebi10 GUESS references

1.7.5.4