Graph Theory and Sparse Matrix Computation: 56 (The IMA Volumes in Mathematics and its Applications) - Tapa blanda

9781461383710: Graph Theory and Sparse Matrix Computation: 56 (The IMA Volumes in Mathematics and its Applications)

Tapa blanda

ISBN 10: 1461383714 ISBN 13: 9781461383710

Editorial: Springer, 2011

Ver todas las copias de esta edici�n del ISBN

0 Usado

7 Nuevo

De EUR 92,27

Book by None

"Sinopsis" puede pertenecer a otra edici�n de este libro.

Rese�a del editor

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.

Rese�a del editor

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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

EditorialSpringer
A�o de publicaci�n2011
ISBN 10 1461383714
ISBN 13 9781461383710
Encuadernaci�nTapa blanda
IdiomaIngl�s
N�mero de p�ginas264
EditorGeorge Alan, Gilbert John R., Liu Joseph W.H.

Comprar nuevo

Ver este art�culo

EUR 92,27

Convertir moneda

EUR 19,49 gastos de env�o desde Alemania a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Otras ediciones populares con el mismo t�tulo

9780387941318: Graph Theory and Sparse Matrix Computation: Workshop on Sparse Matrix Computations: Graph Theory Issues and Algorithms : Selected Papers: 56 (The IMA Volumes in Mathematics and its Applications)

Edici�n Destacada

ISBN 10: 0387941312 ISBN 13: 9780387941318
Editorial: Springer-Verlag New York Inc., 1993
Tapa dura

Resultados de la b�squeda para Graph Theory and Sparse Matrix Computation: 56 (The...

Imagen del vendedor

Graph Theory and Sparse Matrix Computation

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

Publicado por Springer New York, 2011

ISBN 10: 1461383714 ISBN 13: 9781461383710

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: 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. N� de ref. del art�culo: 4196264

Contactar al vendedor

Comprar nuevo

EUR 92,27

Convertir moneda

Gastos de env�o: EUR 19,49

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Graph Theory and Sparse Matrix Computation

Alan George

Publicado por Springer New York Okt 2011, 2011

ISBN 10: 1461383714 ISBN 13: 9781461383710

Nuevo Taschenbuch

Impresi�n bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: 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. N� de ref. del art�culo: 9781461383710

Contactar al vendedor

Comprar nuevo

EUR 106,99

Convertir moneda

Gastos de env�o: EUR 11,00

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

Graph Theory and Sparse Matrix Computation

Alan George

Publicado por Springer New York, Springer US, 2011

ISBN 10: 1461383714 ISBN 13: 9781461383710

Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: 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. N� de ref. del art�culo: 9781461383710

Contactar al vendedor

Comprar nuevo

EUR 109,94

Convertir moneda

Gastos de env�o: EUR 11,99

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen de archivo

Graph Theory and Sparse Matrix Computation (The IMA Volumes in Mathematics and its Applications)

Publicado por Springer, 2011

ISBN 10: 1461383714 ISBN 13: 9781461383710

Nuevo Tapa blanda

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. In. N� de ref. del art�culo: ria9781461383710_new

Contactar al vendedor

Comprar nuevo

EUR 119,42

Convertir moneda

Gastos de env�o: EUR 4,73

De Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen de archivo

Graph Theory and Sparse Matrix Computation

Alan George

Publicado por Springer-Verlag New York Inc., 2011

ISBN 10: 1461383714 ISBN 13: 9781461383710

Nuevo Paperback / softback

Impresi�n bajo demanda

Librería: THE SAINT BOOKSTORE, Southport, Reino Unido

Calificaci�n del vendedor: 5 de 5 estrellas

Paperback / softback. Condici�n: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 405. N� de ref. del art�culo: C9781461383710

Contactar al vendedor