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.
"synopsis" may belong to another edition of this title.
Seller: Books From California, Simi Valley, CA, U.S.A.
Hardcover. Condition: Good. Ex library copy. Seller Inventory # mon0002878893
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: Very Good. *Price HAS BEEN REDUCED by 10% until Monday, May 11 (SALE item)* First edition, first printing, 245 pp., Hardcover, previous owner's name to front free endpaper, spine lightly faded else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB1346638
Seller: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, United Kingdom
Condition: Very Good. Book is undamaged. Probably very lightly used. Has inscriptions to the inside page and cover, otherwise rest of content is in excellent condition. Seller Inventory # 080043-6a
Quantity: 1 available