Graph theory and sparse matrix computation
Sparse matricesCongressesGraph theoryMatricesNumerical analysis
0.0
Open LibraryAbout this book
When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited. The articles in this volume are based on recent research on sparse matrix computations. This volume looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. The articles are grouped into three general categories: graph models of symmetric matrices and factorizations, graph models of algorithms on nonsymmetric matrices, and parallel sparse matrix algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysts and theoretical computer scientists alike.
Themes & subjects
Sparse matricesCongressesGraph theoryMatricesNumerical analysisCombinatorial analysis
About the author
J. R. Gilbert
1953
Reviews
No reviews yet — be the first to write one from the Log screen.
Quotes
No quotes yet.
