George Alan Liu Joseph W H (16 results)

Hardcover. Condition: Good. Ex library copy.

Hardcover. Condition: As New. Still shrinkwrapped; The IMA Volumes In Mathematics And Its Applications; 8vo 8" - 9" tall; 245 pages.

Condition: Very Good. *Price HAS BEEN REDUCED by 10% until Monday, Nov. 3 (weekend SALE item)* 324 pp., Hardcover, bookplate to front free endpaper else text clean & binding tight. - 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.

Condition: New.

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.

Condition: New. In.

245 pp. with Figures, 0387941312 Sprache: Englisch Gewicht in Gramm: 540 Groß 8°, Original-Pappband (Hardcover), Bibliotheks-Exemplar (ordnungsgemäß entwidmet) mit Rückenschild, Stempel auf Titel, insgesamt gutes und innen sauberes Exemplar, (library copy in good condition),

Condition: New. pp. 264.

Paperback. Condition: Brand New. reprint edition. 245 pages. 9.25x6.10x0.60 inches. In Stock.

Taschenbuch. Condition: Neu. Graph Theory and Sparse Matrix Computation | Alan George (u. a.) | Taschenbuch | 245 S. | Englisch | 2011 | Springer | EAN 9781461383710 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 264 pp. Englisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matri.

Condition: New. Print on Demand pp. 264 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 264.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 264 pp. Englisch.