From b1f7552e4ef54c627abeb67d329852f1faf62583 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Mon, 4 Jul 2016 20:58:11 -0400
Subject: [PATCH] books/bookvol10.4 add Bronstein citations for LODE code
Goal: Axiom Literate Programming
\index{Bronstein, Manuel}
\begin{chunk}{axiom.bib}
@misc{Bron92,
author = "Bronstein, Manuel",
title = "Linear Ordinary Differential Equations: Breaking Through the
Order 2 Barrier",
year = "1992",
url =
"http://www-sop.inria.fr/cafe/Manuel.Bronstein/publications/issac92.ps.gz",
paper = "Bron92.pdf",
keywords = "axiomref",
algebra =
"\newline\refto{package ODECONST ConstantLODE}
\newline\refto{package LODEEF ElementaryFunctionLODESolver}
\newline\refto{package ODEPAL PureAlgebraicLODE}
\newline\refto{package ODERAT RationalLODE}
\newline\refto{package ODERED ReduceLODE}",
abstract = "
A major subproblem for algorithms that either factor ordinary linear
differential equations or compute their closed form solutions is to
find their solutions $y$ which satisfy $y^{'}/y \in \overline{K}(x)$
where $K$ is the constant field for the coefficients of the equation.
While a decision procedure for this subproblem was known in the
$19^{th}$ century, it requires factoring polynomials over
$\overline{K}$ and has not been implemented in full generality. We
present here an efficient algorithm for this subproblem, which has
been implemented in the AXIOM computer algebra system for equations of
arbitrary order over arbitrary fields of characteristic 0. This
algorithm never needs to compute with the individual complex
singularities of the equation, and algebraic numbers are added only
when they appear in the potential solutions. Implementation of the
complete Singer algorithm for $n=2,3$ based on this building block is
in progress."
}
\end{chunk}
---
books/bookvol10.4.pamphlet | 25 +++++++++++++++++++++++++
books/bookvolbib.pamphlet | 14 ++++++++++----
changelog | 2 ++
patch | 39 ++++++++++++++++++++++++++++++++++++++-
src/axiom-website/patches.html | 2 ++
5 files changed, 77 insertions(+), 5 deletions(-)
diff --git a/books/bookvol10.4.pamphlet b/books/bookvol10.4.pamphlet
index bad16b7..0a139a3 100644
--- a/books/bookvol10.4.pamphlet
+++ b/books/bookvol10.4.pamphlet
@@ -16973,11 +16973,16 @@ o )show ConstantLODE
{\bf Exports:}\\
\cross{ODECONST}{constDsolve}
+See Bronstein\cite{Bron92}
+\label{package ODECONST ConstantLODE}
\begin{chunk}{package ODECONST ConstantLODE}
)abbrev package ODECONST ConstantLODE
++ Author: Manuel Bronstein
++ Date Created: 18 March 1991
++ Date Last Updated: 3 February 1994
+++ References:
+++ Bron92 Linear Ordinary Differential Equations: Breaking Through the
+++ Order 2 Barrier
++ Description:
++ Solution of linear ordinary differential equations,
++ constant coefficient case.
@@ -35749,11 +35754,16 @@ o )show ElementaryFunctionLODESolver
{\bf Exports:}\\
\cross{LODEEF}{solve}
+See Bronstein\cite{Bron92}
+\label{package LODEEF ElementaryFunctionLODESolver}
\begin{chunk}{package LODEEF ElementaryFunctionLODESolver}
)abbrev package LODEEF ElementaryFunctionLODESolver
++ Author: Manuel Bronstein
++ Date Created: 3 February 1994
++ Date Last Updated: 9 March 1994
+++ References:
+++ Bron92 Linear Ordinary Differential Equations: Breaking Through the
+++ Order 2 Barrier
++ Description:
++ \spad{ElementaryFunctionLODESolver} provides the top-level
++ functions for finding closed form solutions of linear ordinary
@@ -218795,11 +218805,16 @@ o )show PureAlgebraicLODE
{\bf Exports:}\\
\cross{ODEPAL}{algDsolve}
+See Bronstein\cite{Bron92}
+\label{package ODEPAL PureAlgebraicLODE}
\begin{chunk}{package ODEPAL PureAlgebraicLODE}
)abbrev package ODEPAL PureAlgebraicLODE
++ Author: Manuel Bronstein
++ Date Created: 21 August 1991
++ Date Last Updated: 3 February 1994
+++ References:
+++ Bron92 Linear Ordinary Differential Equations: Breaking Through the
+++ Order 2 Barrier
++ Description:
++ In-field solution of an linear ordinary differential equation,
++ pure algebraic case.
@@ -225057,11 +225072,16 @@ o )show RationalLODE
\cross{ODERAT}{ratDsolve}
\end{tabular}
+See Bronstein\cite{Bron92}
+\label{package ODERAT RationalLODE}
\begin{chunk}{package ODERAT RationalLODE}
)abbrev package ODERAT RationalLODE
++ Author: Manuel Bronstein
++ Date Created: 13 March 1991
++ Date Last Updated: 13 April 1994
+++ References:
+++ Bron92 Linear Ordinary Differential Equations: Breaking Through the
+++ Order 2 Barrier
++ Description:
++ \spad{RationalLODE} provides functions for in-field solutions of linear
++ ordinary differential equations, in the rational case.
@@ -228732,11 +228752,16 @@ o )show ReduceLODE
{\bf Exports:}\\
\cross{ODERED}{reduceLODE}
+See Bronstein\cite{Bron92}
+\label{package ODERED ReduceLODE}
\begin{chunk}{package ODERED ReduceLODE}
)abbrev package ODERED ReduceLODE
++ Author: Manuel Bronstein
++ Date Created: 19 August 1991
++ Date Last Updated: 11 April 1994
+++ References:
+++ Bron92 Linear Ordinary Differential Equations: Breaking Through the
+++ Order 2 Barrier
++ Description:
++ Elimination of an algebraic from the coefficentss
++ of a linear ordinary differential equation.
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 7677e96..f1486cb 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -12117,16 +12117,22 @@ Springer-Verlag, NY (1991)
\end{chunk}
\index{Bronstein, Manuel}
-\begin{chunk}{ignore}
-\bibitem[Bronstein 92]{Bro92}
- author = "Bronstein, M.",
+\begin{chunk}{axiom.bib}
+@misc{Bron92,
+ author = "Bronstein, Manuel",
title = "Linear Ordinary Differential Equations: Breaking Through the
Order 2 Barrier",
year = "1992",
url =
"http://www-sop.inria.fr/cafe/Manuel.Bronstein/publications/issac92.ps.gz",
- paper = "Bro92.pdf",
+ paper = "Bron92.pdf",
keywords = "axiomref",
+ algebra =
+ "\newline\refto{package ODECONST ConstantLODE}
+ \newline\refto{package LODEEF ElementaryFunctionLODESolver}
+ \newline\refto{package ODEPAL PureAlgebraicLODE}
+ \newline\refto{package ODERAT RationalLODE}
+ \newline\refto{package ODERED ReduceLODE}",
abstract = "
A major subproblem for algorithms that either factor ordinary linear
differential equations or compute their closed form solutions is to
diff --git a/changelog b/changelog
index 253c760..e30339b 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20160704 tpd src/axiom-website/patches.html 20160704.03.tpd.patch
+20160704 tpd books/bookvol10.4 add Bronstein citations for LODE code
20160704 tpd src/axiom-website/patches.html 20160704.02.tpd.patch
20160704 tpd books/bookvol10.3 add Dupee, Dewar citations to algebra
20160704 tpd src/axiom-website/patches.html 20160704.01.tpd.patch
diff --git a/patch b/patch
index 094c49b..abda82d 100644
--- a/patch
+++ b/patch
@@ -1,4 +1,41 @@
-books/bookvol10.3 add Dupee, Dewar citations to algebra
+books/bookvol10.4 add Bronstein citations for LODE code
Goal: Axiom Literate Programming
+\index{Bronstein, Manuel}
+\begin{chunk}{axiom.bib}
+@misc{Bron92,
+ author = "Bronstein, Manuel",
+ title = "Linear Ordinary Differential Equations: Breaking Through the
+ Order 2 Barrier",
+ year = "1992",
+ url =
+ "http://www-sop.inria.fr/cafe/Manuel.Bronstein/publications/issac92.ps.gz",
+ paper = "Bron92.pdf",
+ keywords = "axiomref",
+ algebra =
+ "\newline\refto{package ODECONST ConstantLODE}
+ \newline\refto{package LODEEF ElementaryFunctionLODESolver}
+ \newline\refto{package ODEPAL PureAlgebraicLODE}
+ \newline\refto{package ODERAT RationalLODE}
+ \newline\refto{package ODERED ReduceLODE}",
+ abstract = "
+ A major subproblem for algorithms that either factor ordinary linear
+ differential equations or compute their closed form solutions is to
+ find their solutions $y$ which satisfy $y^{'}/y \in \overline{K}(x)$
+ where $K$ is the constant field for the coefficients of the equation.
+ While a decision procedure for this subproblem was known in the
+ $19^{th}$ century, it requires factoring polynomials over
+ $\overline{K}$ and has not been implemented in full generality. We
+ present here an efficient algorithm for this subproblem, which has
+ been implemented in the AXIOM computer algebra system for equations of
+ arbitrary order over arbitrary fields of characteristic 0. This
+ algorithm never needs to compute with the individual complex
+ singularities of the equation, and algebraic numbers are added only
+ when they appear in the potential solutions. Implementation of the
+ complete Singer algorithm for $n=2,3$ based on this building block is
+ in progress."
+}
+
+\end{chunk}
+
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 804aa30..4d21d6b 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5448,6 +5448,8 @@ books/bookvol10.4, bookvol10 document PAFFFF and unit tests

books/bookvolbib Axiom Citations in the Literature

20160704.02.tpd.patch
books/bookvol10.3 add Dupee, Dewar citations to algebra

+20160704.03.tpd.patch
+books/bookvol10.4 add Bronstein citations for LODE code

--
1.7.5.4