The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.
  • Description

CHAPTERS

CHAPTERS

For selected items:
Full Access

Front Matter

pp. i–vi
Abstract
Full Access

Low-Memory Algorithmic Adjoint Propagation

pp. 1–10
Abstract
Full Access

On spectral partitioning of signed graphs

pp. 11–22
Abstract
Full Access

Fault Tolerant Resource Efficient Matrix Multiplication

pp. 23–34
Abstract
Full Access

Evolving Difficult Graphs for Laplacian Solvers

pp. 35–44
Abstract
Full Access

Index Reduction for Differential-Algebraic Equations with Mixed Matrices

pp. 45–55
Abstract
Full Access

Approximation algorithms for maximum matchings in undirected graphs

pp. 56–65
Abstract
Full Access

Multi-criteria Graph Partitioning with Scotch

pp. 66–75
Abstract
Full Access

Fast and effective reordering of columns within supernodes using partition refinement

pp. 76–86
Abstract
Full Access

Highly scalable distributed-memory sparse triangular solution algorithms

pp. 87–96
Abstract
Full Access

New Approximation Algorithms for Minimum Weighted Edge Cover

pp. 97–108
Abstract
cover image Proceedings

Recommended Content

40 off sale logo