From 7a214a3dd70fcec9188a984bbe97851cbe31553f Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Wed, 6 Apr 2016 21:16:01 -0400
Subject: [PATCH] books/bookvolbib add Davi11, The UFlorida Sparse Matrix
Coll.
Goal: Axiom Numerics
@article{Davi11,
author = "Davis, Timothy A. and Hu, Yifan",
title = "The University of Florida Sparse Matrix Collection",
journal = "ACM Trans. on Math. Software",
volume = "38",
number = "1",
year = "2011",
month = "November",
url = "http://yifanhu.net/PUB/matrices.pdf",
paper = "Davi11.pdf",
abstract =
"We describe the Univerity of Florida Sparse Matrix Collection, a large
and actively growing set of sparse matrices that arise in real
applications. The Collection is widely used by the numerical linear
algebra community for the development and performance evaluation of
sparse matrix algorithms. It allows for robust and repeatable
experiments: robust because performance results with artificially
generated matrices can be misleading, and repeatable because matrices
are curated and made publicly available in many formats. Its matrices
cover a wide spectrum of domains, including those arising from
problems with underlying 2D or 3D geometry (as structural engineering,
computational fluid dynamics, model reduction, electromagnetics,
semiconductor devices, thermodynamics, materials, acoustics, computer
graphics/vision, robitics/kinematics, and other discretizations) and
those that typically do not have such geometry (optimization, circuit
simulation, economic and financial modeling, theoretical and quantum
chemistry, chemical process simulation, mathematics and statistics,
power networks, and other networks and graphs). We provide software
for accessing and managing the Collection, from MATLAB, Mathematica,
Fortran, and C, as well as an online search capability. Graph
visualization of the matrices is provided, and a new multilevel
coarsening scheme is proposed to facilitate this task."
}
---
books/bookvolbib.pamphlet | 40 +++++++++++++++++++++++
changelog | 2 +
patch | 70 +++++++++++++++++++---------------------
src/axiom-website/patches.html | 2 +
4 files changed, 77 insertions(+), 37 deletions(-)
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 4e9ba6a..034a049 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -2146,6 +2146,46 @@ when shown in factored form.
\end{chunk}
+\index{Davis, Timothy A.}
+\index{Hu, Yifan}
+\begin{chunk}{axiom.bib}
+@article{Davi11,
+ author = "Davis, Timothy A. and Hu, Yifan",
+ title = "The University of Florida Sparse Matrix Collection",
+ journal = "ACM Trans. on Math. Software",
+ volume = "38",
+ number = "1",
+ year = "2011",
+ month = "November",
+ url = "http://yifanhu.net/PUB/matrices.pdf",
+ paper = "Davi11.pdf",
+ abstract =
+ "We describe the Univerity of Florida Sparse Matrix Collection, a large
+ and actively growing set of sparse matrices that arise in real
+ applications. The Collection is widely used by the numerical linear
+ algebra community for the development and performance evaluation of
+ sparse matrix algorithms. It allows for robust and repeatable
+ experiments: robust because performance results with artificially
+ generated matrices can be misleading, and repeatable because matrices
+ are curated and made publicly available in many formats. Its matrices
+ cover a wide spectrum of domains, including those arising from
+ problems with underlying 2D or 3D geometry (as structural engineering,
+ computational fluid dynamics, model reduction, electromagnetics,
+ semiconductor devices, thermodynamics, materials, acoustics, computer
+ graphics/vision, robitics/kinematics, and other discretizations) and
+ those that typically do not have such geometry (optimization, circuit
+ simulation, economic and financial modeling, theoretical and quantum
+ chemistry, chemical process simulation, mathematics and statistics,
+ power networks, and other networks and graphs). We provide software
+ for accessing and managing the Collection, from MATLAB, Mathematica,
+ Fortran, and C, as well as an online search capability. Graph
+ visualization of the matrices is provided, and a new multilevel
+ coarsening scheme is proposed to facilitate this task."
+}
+
+\end{chunk}
+
+
\index{Demmel, James}
\index{Kahan, W.}
\begin{chunk}{axiom.bib}
diff --git a/changelog b/changelog
index 8108e74..f4a8070 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20160406 tpd src/axiom-website/patches.html 20160406.03.tpd.patch
+20160406 tpd books/bookvolbib add Davi11, The UFlorida Sparse Matrix Coll.
20160406 tpd src/axiom-website/patches.html 20160406.02.tpd.patch
20160406 tpd books/bookvolbib add Ahre15
20160406 tpd src/axiom-website/patches.html 20160406.01.tpd.patch
diff --git a/patch b/patch
index 3934f73..1811496 100644
--- a/patch
+++ b/patch
@@ -1,42 +1,38 @@
-books/bookvolbib add Ahre15
+books/bookvolbib add Davi11, The UFlorida Sparse Matrix Coll.
Goal: Axiom Numerics
-@techreport{Ahre15,
- author = "Ahrens, Peter and Nguyen, Hong Diep and Demmel, James",
- title = "Efficient Reproducible Floating Point Summation and BLAS",
- institution = "University of California, Berkeley",
- year = "2015",
- month = "December",
- type = "technical report",
- number = "229",
- paper = "Ahre15.pdf",
- url = "http://www.eecs.berkeley.edu/Pubs/TechRpts/2015/EECS-2015-229.pdf",
- abstract =
- "We define reproducibility to mean getting bitwise identical results
- from multiple runs of the same program, perhaps with different
- hardware resources or other changes that should ideally not change the
- answer. Many users depend on reproducibility for debugging or
- correctness. However, dynamic scheduling of parallel computing
- resources, combined with nonassociativity of floating point addition,
- makes attaining reproducibility a challenge even for simple operations
- like summing a vector of numbers, or more complicated operations like
- Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that
- computes a reproducible sum of floating point numbers independent of
- the order of summation. The algorithm depends only on a subset of the
- IEEE Floating Point Standard 754-2008. It is communication-optimal, in
- the sense that it does just one pass over the data in the sequential
- case, or one reduction operation in the parallel case, requiring an
- ``accumulator'' represented by just 6 floating point words (more can
- be used if higher precision is desired). Th arithmetic code with a
- 6-word accumulator is $7n$ floating point additions to sum $n$ words,
- and (in IEEEE double precision) the final error bound can be up to
- $10^8$ times smaller than the error bound for conventional
- summation. We describe the basic summation algorithm, the software
- infrastructure used to build reproducible BLAS (ReproBLAS), and
- performance results. For example, when computing the dot product of
- 4096 double precision floating point numbers, we get a $4x$ slowdown
- compared to Intel Math Kernel Library (MKL) running on an Intel Core
- i7-2600 CPU operating at 3.4 GHz and 256 KB L2 Cache."
+@article{Davi11,
+ author = "Davis, Timothy A. and Hu, Yifan",
+ title = "The University of Florida Sparse Matrix Collection",
+ journal = "ACM Trans. on Math. Software",
+ volume = "38",
+ number = "1",
+ year = "2011",
+ month = "November",
+ url = "http://yifanhu.net/PUB/matrices.pdf",
+ paper = "Davi11.pdf",
+ abstract =
+ "We describe the Univerity of Florida Sparse Matrix Collection, a large
+ and actively growing set of sparse matrices that arise in real
+ applications. The Collection is widely used by the numerical linear
+ algebra community for the development and performance evaluation of
+ sparse matrix algorithms. It allows for robust and repeatable
+ experiments: robust because performance results with artificially
+ generated matrices can be misleading, and repeatable because matrices
+ are curated and made publicly available in many formats. Its matrices
+ cover a wide spectrum of domains, including those arising from
+ problems with underlying 2D or 3D geometry (as structural engineering,
+ computational fluid dynamics, model reduction, electromagnetics,
+ semiconductor devices, thermodynamics, materials, acoustics, computer
+ graphics/vision, robitics/kinematics, and other discretizations) and
+ those that typically do not have such geometry (optimization, circuit
+ simulation, economic and financial modeling, theoretical and quantum
+ chemistry, chemical process simulation, mathematics and statistics,
+ power networks, and other networks and graphs). We provide software
+ for accessing and managing the Collection, from MATLAB, Mathematica,
+ Fortran, and C, as well as an online search capability. Graph
+ visualization of the matrices is provided, and a new multilevel
+ coarsening scheme is proposed to facilitate this task."
}
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index bbb47c3..1e0a18c 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5288,6 +5288,8 @@ books/bookvol10.5.pamphlet remove \uscore

books/bookvol10.2 fix unit tests for MATCAT users

20160406.02.tpd.patch
books/bookvolbib add Ahre15

+20160406.03.tpd.patch
+books/bookvolbib add Davi11, The UFlorida Sparse Matrix Coll.

--
1.7.5.4