Graph Theory and Sparse Matrix Computation

€159.00
+ €8.99 Shipping

Graph Theory and Sparse Matrix Computation

  • Brand: Unbranded
Sold by:

Graph Theory and Sparse Matrix Computation

  • Brand: Unbranded

€159.00

In stock
+ €8.99 Shipping

14-Day Returns Policy

Sold by:

€159.00

In stock
+ €8.99 Shipping

14-Day Returns Policy

Payment methods:

Description

Graph Theory and Sparse Matrix Computation

An introduction to chordal graphs and clique trees. - Cutting down on fill using nested dissection: Provably good elimination orderings. - Automatic Mesh Partitioning. - Structural representations of Schur complements in sparse matrices. - Irreducibility and primitivity of Perron complements: Application of the compressed directed graph. - Predicting structure in nonsymmetric sparse matrix factorizations. - Highly parallel sparse triangular solution. - The fan-both family of column-based distributed Cholesky factorization algorithms. - Scalability of sparse direct solvers. - Sparse matrix factorization on SIMD parallel computers. - The efficient parallel iterative solution of large sparse linear systems. Language: English
  • Brand: Unbranded
  • Category: Education
  • Artist: Alan George
  • Format: Paperback
  • Language: English
  • Publication Date: 2011/10/24
  • Publisher / Label: Springer
  • Number of Pages: 245
  • Fruugo ID: 343653266-752834266
  • ISBN: 9781461383710

Delivery & Returns

Dispatched within 6 days

  • STANDARD: €8.99 - Delivery between Wed 07 January 2026–Mon 12 January 2026

Shipping from United Kingdom.

We do our best to ensure that the products that you order are delivered to you in full and according to your specifications. However, should you receive an incomplete order, or items different from the ones you ordered, or there is some other reason why you are not satisfied with the order, you may return the order, or any products included in the order, and receive a full refund for the items. View full return policy