Graph Theory and Sparse Matrix Computation

George, Alan & John R. Gilbert & Joseph W. H. Liu

ISBN 10: 0387941312 / ISBN 13: 9780387941318

Published by Springer, 1993

About this Item

Still shrinkwrapped; The IMA Volumes In Mathematics And Its Applications; 8vo 8" - 9" tall; 245 pages. Seller Inventory # 205949

Bibliographic Details

Title: Graph Theory and Sparse Matrix Computation

Publisher: Springer

Publication Date: 1993

Binding: Hardcover

Condition: As New

Dust Jacket Condition: No Dust Jacket As Issued

About this title

Synopsis:

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 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.