With new processor families appearing every few years, it is
increasingly harder to achieve high performance rates in sparse
matrix computations. This monograph studies new methods for sparse
matrix factorizations and applies them efficiently while retaining
ease of use of existing solutions. The implementations are timed
and analyzed using a commonly accepted set of test matrices.
Contemporary processors are used for the tests. The new
factorization techniques are proven to be quite competitive with
state of the art software. In addition, an optimization effort is
applied to an iterative algorithm that stands out for its numerical
robustness. This also gives satisfactory results on the tested
computing platforms in terms of performance improvement. The same
set of test matrices is used to enable an easy comparison between
both investigated techniques, even though they are customarily
treated separately in the literature. Possible extensions of the
presented work range from easily conceivable merging with existing
solutions to rather more evolved schemes dependent on hard to
predict progress in theoretical and algorithmic research.
General
Imprint: |
Lap Lambert Academic Publishing
|
Country of origin: |
Germany |
Release date: |
June 2010 |
First published: |
June 2010 |
Authors: |
Piotr Luszczek
|
Dimensions: |
229 x 152 x 5mm (L x W x T) |
Format: |
Paperback - Trade
|
Pages: |
84 |
ISBN-13: |
978-3-8383-3469-1 |
Categories: |
Books >
Computing & IT >
General theory of computing >
General
|
LSN: |
3-8383-3469-8 |
Barcode: |
9783838334691 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!