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.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

Edward Bowditch Ltd
Exstowe, Exton, Exeter, EX3 0PP, United Kingdom

Terms of Sale:

Legal entity name: Edward Bowditch Ltd
Legal entity form: Limited company
Business correspondence address: Exstowe, Exton, Exeter, EX3 0PP
Company registration number: 04916632
VAT registration: GB834241546
Authorised representative: Mr. E. Bowditch

Shipping Terms:

Orders usually dispatched within two working days. Please note that at this time all domestic United Kingdom orders are sent by trackable UPS courier, we choose not to offer a lower cost alternative.

Payment Methods
accepted by seller

Add to Wants

Items related to Graph Theory and Sparse Matrix Computation (The Ima...

Graph Theory and Sparse Matrix Computation (The Ima Volumes in Mathematics and Its Applications)

George, Alan (Editor) / Gilbert, John R. (Editor) / Liu, Joseph W.H. (Editor)

New - Soft cover

Seller's business information