Volume 21 (2005)
Special Volume on Combinatorial Scientific Computing
Dedicated to Alan George on the occasion of his sixtieth birthday
(See the preface for more details.)
-
Title page
-
Table of contents and abstracts
-
Preface
-
A tree-based dataflow model for the unsymmetric multifrontal method
-
QR factorizations using a restricted set of rotations
-
Obtaining bounds on the two norm of a matrix from the splitting lemma
-
Communication balancing in parallel sparse matrix-vector multiplication
-
Addressing the stochastic nature of scientific computations via dynamic loop scheduling
-
Locality of reference in sparse Cholesky factorization methods
-
Finding nonoverlapping substructures of a sparse matrix
-
The influence of random number generators on graph partitioning algorithms
-
Optimality-preserving elimination of linearities in Jacobian accumulation