Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Corriere Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Graph Theory and Sparse Matrix Computation

Name: Graph Theory and Sparse Matrix Computation
Brand: Springer-Verlag New York Inc.
SKU: 06797183
Price: 107.29 EUR
Availability: InStock
Author: Alan George
ISBN: 9781461383710

Alan George

John R. Gilbert

Joseph W. H. Liu

Lingua

Inglese

Libro In brossura

Codice Libristo: 06797183

Casa editrice Springer-Verlag New York Inc., ottobre 2011

This IMA Volume in Mathematics and its Appllcations GRAPH THEORY AND SPARSE MATRIX COMPUTATION is ba... Descrizione completa

Codice Libristo: 06797183

263 b

107.29 €

Magazzino esterno Inviamo tra 5-8 giorni

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

Du Suicide Et de la Folie-Suicide, Consideres Dans Leurs Rapports BRIERRE DE BOISMONT-

In brossura

47.59 €

Doppelleben Einer Geliebten Elore Likas

In brossura

13.99 €

To Portraito Ths Poihshs MS Juliana Dotsi

In brossura

14.09 €

Antonii Mizaldi Monsluciani Phaenomena Sive Disputatio (1587) Antoine Mizauld

In brossura

25.89 €

Estudo da qualidade microbiologica da agua de um rio brasileiro Silva Trajano Felipe Barrabas Xavier Da

In brossura

52.19 €

Právo EU pro praxi: Aplikační a výkladová úskalí v kontextu případových studií Tereza Kunertová

In brossura

27.69 €

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.