Graph Theory And Sparse Matrix Computation
Download and Read Graph Theory And Sparse Matrix Computation full books in PDF, ePUB, and Kindle. Read online free Graph Theory And Sparse Matrix Computation ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
Graph Theory and Sparse Matrix Computation
Author | : Alan George |
Publisher | : Springer Science & Business Media |
Total Pages | : 254 |
Release | : 2012-12-06 |
Genre | : Mathematics |
ISBN | : 1461383692 |
Download Graph Theory and Sparse Matrix Computation Book in PDF, Epub and Kindle
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.
Graph Theory and Sparse Matrix Computation Related Books
Pages: 254
Pages: 245
Pages: 388
Pages: 228
Pages: 346