Check nearby libraries
Buy 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.
Check nearby libraries
Buy this book
Showing 4 featured editions. View all 4 editions?
Edition | Availability |
---|---|
1 |
zzzz
Libraries near you:
WorldCat
|
2 |
zzzz
Libraries near you:
WorldCat
|
3 |
zzzz
Libraries near you:
WorldCat
|
4
Graph theory and sparse matrix computation
1993, Springer-Verlag, Springer
in English
0387941312 9780387941318
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created April 1, 2008
- 7 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
July 24, 2024 | Edited by MARC Bot | import existing book |
March 17, 2023 | Edited by ImportBot | import existing book |
November 16, 2020 | Edited by MARC Bot | import existing book |
March 11, 2019 | Edited by MARC Bot | import existing book |
April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |