Volume 21 (2005)

Special Volume on Combinatorial Scientific Computing
Dedicated to Alan George on the occasion of his sixtieth birthday
Title page
Table of contents and abstracts
Pages i-v; Full Text (PDF) [37 KB]
Page vi; Full Text (PDF) [8 KB]
A tree-based dataflow model for the unsymmetric multifrontal method
Stanley C. Eisenstat and Joseph W. H. Liu
Pages 1-19; Abstract and links, Full Text (PDF) [305 KB]
QR factorizations using a restricted set of rotations
Dianne P. O'Leary and Stephen S. Bullock
Pages 20-27; Abstract and links, Full Text (PDF) [147 KB]
Obtaining bounds on the two norm of a matrix from the splitting lemma
Doron Chen, John R. Gilbert, and Sivan Toledo
Pages 28-46; Abstract and links, Full Text (PDF) [262 KB]
Communication balancing in parallel sparse matrix-vector multiplication
Rob H. Bisseling and Wouter Meesen
Pages 47-65; Abstract and links, Full Text (PDF) [285 KB]
Addressing the stochastic nature of scientific computations via dynamic loop scheduling
Ioana Banicescu and Ricolindo L. Cariño
Pages 66-80; Abstract and links, Full Text (PDF) [325 KB]
Locality of reference in sparse Cholesky factorization methods
Elad Rozin and Sivan Toledo
Pages 81-106; Abstract and links, Full Text (PDF) [649 KB]
Finding nonoverlapping substructures of a sparse matrix
Ali Pinar and Virginia Vassilevska
Pages 107-124; Abstract and links, Full Text (PDF) [321 KB]
The influence of random number generators on graph partitioning algorithms
Ulrich Elsner
Pages 125-133; Abstract and links, Full Text (PDF) [242 KB]
Optimality-preserving elimination of linearities in Jacobian accumulation
Uwe Naumann and Jean Utke
Pages 134-150; Abstract and links, Full Text (PDF) [438 KB]