Free Shipping on Order Over $60
AfterPay Available
Parallelism in Matrix Computations

Parallelism in Matrix Computations

by Bernard PhilippeEfstratios Gallopoulos and Ahmed H. Sameh
Paperback
Publication Date: 23/10/2016
  $176.16
or 4 easy payments of $44.04 with
afterpay
This item qualifies for FREE delivery
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations.

It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms.



The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of parallel iterative linear system solvers with emphasis on scalable preconditioners, (b) parallel schemes for obtaining a few of the extreme eigenpairs or those contained in a given interval in the spectrum of a standard or generalized symmetric eigenvalue problem, and (c) parallel methods for computing a few of the extreme singular triplets. Part IV focuses on the development of parallel algorithms for matrix functions and special characteristics such as the matrix pseudospectrum and the determinant. The book also reviews the theoretical and practical background necessary when designing these algorithms and includes an extensive bibliography that will be useful to researchers and students alike.



The book brings together many existing algorithms for the fundamental matrix computations that have a proven track record of efficient implementation in terms of data locality and data transfer on state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.
ISBN:
9789402403176
9789402403176
Category:
Maths for engineers
Format:
Paperback
Publication Date:
23-10-2016
Publisher:
Springer
Country of origin:
Netherlands
Pages:
473
Dimensions (mm):
235x155x26mm
Weight:
7.55kg

This title is in stock with our Australian supplier and arrives at our Sydney warehouse within 10-15 working days of you placing an order.

Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.

Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:

ACT Metro  2 working days

NSW Metro  2 working days

NSW Rural  2 - 3 working days

NSW Remote  2 - 5 working days

NT Metro  3 - 6 working days

NT Remote  4 - 10 working days

QLD Metro  2 - 4 working days

QLD Rural  2 - 5 working days

QLD Remote  2 - 7 working days

SA Metro  2 - 5 working days

SA Rural  3 - 6 working days

SA Remote  3 - 7 working days

TAS Metro  3 - 6 working days

TAS Rural  3 - 6 working days

VIC Metro  2 - 3 working days

VIC Rural  2 - 4 working days

VIC Remote  2 - 5 working days

WA Metro  3 - 6 working days

WA Rural  4 - 8 working days

WA Remote  4 - 12 working days

Customer Reviews

Be the first to review Parallelism in Matrix Computations.