This IMA Volume in Mathematics and its Appllcations GRAPH THEORY AND SPARSE MATRIX COMPUTATION is based on the proceedings of a workshop that was an integraI part of the 1991- 92 IMA program on "Applied Linear AIgebra." The purpose of the workshop was to bring together people who work in sparse matrix computation with those who conduct research in applied graph theory and grl:l,ph algorithms, in order to foster active cross-fertilization. We are grateful to Richard Brualdi, George Cybenko, Alan Geo~ge, Gene Golub, Mitchell Luskin, and Paul Van Dooren for planning and implementing the year-Iong program. We espeeially thank Alan George, John R. Gilbert, and Joseph W.H. Liu for organizing this workshop and editing the proceedings. The finaneial support of the National Science Foundation made the workshop possible. A vner Friedman Willard Miller. Jr. PREFACE When reality is modeled by computation, linear algebra is often the con nec tiori between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer. Efficiency demands that every possible advantage be exploited: sparse structure, advanced com puter architectures, efficient algorithms. Therefore sparse matrix computation knits together threads from linear algebra, parallei computing, data struetures, geometry, and both numerieal and discrete algorithms.

*"synopsis" may belong to another edition of this title.*

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

US$ 119.68

**Shipping:**
FREE

From United Kingdom to U.S.A.

Published by
Springer-Verlag New York Inc., United States
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Paperback
Quantity Available: 10

Seller

Rating

**Book Description **Springer-Verlag New York Inc., United States, 2011. Paperback. Book Condition: New. 237 x 156 mm. Language: English . Brand New Book ***** Print on Demand *****.This IMA Volume in Mathematics and its Appllcations GRAPH THEORY AND SPARSE MATRIX COMPUTATION is based on the proceedings of a workshop that was an integraI part of the 1991- 92 IMA program on Applied Linear AIgebra. The purpose of the workshop was to bring together people who work in sparse matrix computation with those who conduct research in applied graph theory and grl:l,ph algorithms, in order to foster active cross-fertilization. We are grateful to Richard Brualdi, George Cybenko, Alan Geo~ge, Gene Golub, Mitchell Luskin, and Paul Van Dooren for planning and implementing the year-Iong program. We espeeially thank Alan George, John R. Gilbert, and Joseph W.H. Liu for organizing this workshop and editing the proceedings. The finaneial support of the National Science Foundation made the workshop possible. A vner Friedman Willard Miller. Jr. PREFACE When reality is modeled by computation, linear algebra is often the con nec- tiori between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer. Efficiency demands that every possible advantage be exploited: sparse structure, advanced com- puter architectures, efficient algorithms. Therefore sparse matrix computation knits together threads from linear algebra, parallei computing, data struetures, geometry, and both numerieal and discrete algorithms. Softcover reprint of the original 1st ed. 1993. Bookseller Inventory # AAV9781461383710

More Information About This Seller | Ask Bookseller a Question

Published by
Springer
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Springer, 2011. Paperback. Book Condition: NEW. 9781461383710 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE0303131

More Information About This Seller | Ask Bookseller a Question

Published by
Springer-Verlag New York Inc., United States
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Paperback
Quantity Available: 10

Seller

Rating

**Book Description **Springer-Verlag New York Inc., United States, 2011. Paperback. Book Condition: New. 237 x 156 mm. Language: English . Brand New Book ***** Print on Demand *****. This IMA Volume in Mathematics and its Appllcations GRAPH THEORY AND SPARSE MATRIX COMPUTATION is based on the proceedings of a workshop that was an integraI part of the 1991- 92 IMA program on Applied Linear AIgebra. The purpose of the workshop was to bring together people who work in sparse matrix computation with those who conduct research in applied graph theory and grl:l,ph algorithms, in order to foster active cross-fertilization. We are grateful to Richard Brualdi, George Cybenko, Alan Geo~ge, Gene Golub, Mitchell Luskin, and Paul Van Dooren for planning and implementing the year-Iong program. We espeeially thank Alan George, John R. Gilbert, and Joseph W.H. Liu for organizing this workshop and editing the proceedings. The finaneial support of the National Science Foundation made the workshop possible. A vner Friedman Willard Miller. Jr. PREFACE When reality is modeled by computation, linear algebra is often the con nec- tiori between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer. Efficiency demands that every possible advantage be exploited: sparse structure, advanced com- puter architectures, efficient algorithms. Therefore sparse matrix computation knits together threads from linear algebra, parallei computing, data struetures, geometry, and both numerieal and discrete algorithms. Softcover reprint of the original 1st ed. 1993. Bookseller Inventory # AAV9781461383710

More Information About This Seller | Ask Bookseller a Question

Published by
Springer-Verlag New York Inc.
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Quantity Available: > 20

Seller

Rating

**Book Description **Springer-Verlag New York Inc., 2011. PAP. Book Condition: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # LQ-9781461383710

More Information About This Seller | Ask Bookseller a Question

Published by
Springer-Verlag New York Inc.
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Quantity Available: > 20

Seller

Rating

**Book Description **Springer-Verlag New York Inc., 2011. PAP. Book Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9781461383710

More Information About This Seller | Ask Bookseller a Question

Published by
Springer
(2016)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Springer, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9781461383710_lsuk

More Information About This Seller | Ask Bookseller a Question

Published by
Springer
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Paperback
Quantity Available: 10

Seller

Rating

**Book Description **Springer, 2011. Paperback. Book Condition: New. This item is printed on demand. Bookseller Inventory # INGM9781461383710

More Information About This Seller | Ask Bookseller a Question

Published by
Springer
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Softcover
Quantity Available: 5

Seller

Rating

**Book Description **Springer, 2011. Book Condition: New. This item is printed on demand for shipment within 3 working days. Bookseller Inventory # KP9781461383710

More Information About This Seller | Ask Bookseller a Question

Published by
Springer
(2011)

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Springer, 2011. Paperback. Book Condition: New. book. Bookseller Inventory # 1461383714

More Information About This Seller | Ask Bookseller a Question

Published by
Springer

ISBN 10: 1461383714
ISBN 13: 9781461383710

New
Paperback
Quantity Available: 20

Seller

Rating

**Book Description **Springer. Paperback. Book Condition: New. Paperback. 245 pages. Dimensions: 9.3in. x 6.1in. x 0.8in.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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Bookseller Inventory # 9781461383710

More Information About This Seller | Ask Bookseller a Question