Generic compressed sparse matrix insertion: algorithms and implementations in MTL4 and FEniCS

Authors:
Peter Gottschling;Dag Lindbo
Affiliations:
Technische Universität Dresden, Germany;Kungliga Tekniska Högskolan (KTH), Sweden
Venue:
Proceedings of the 8th workshop on Parallel/High-Performance Object-Oriented Scientific Computing
Year:
2009

Citing 3
Cited 2

A compiler for variational forms

ACM Transactions on Mathematical Software (TOMS)
AMDiS: adaptive multidimensional simulations

Computing and Visualization in Science
Representation-transparent matrix algorithms with scalable performance

Proceedings of the 21st annual international conference on Supercomputing

Data structure properties for scientific computing: an algebraic topology library

Proceedings of the 8th workshop on Parallel/High-Performance Object-Oriented Scientific Computing
Accelerated non-linear finite volume method for diffusion

Journal of Computational Physics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse matrices are indispensable components of most scientific applications. Nevertheless, there is very little general-purpose software support. With the Matrix Template Library 4 (MTL4) we provide a generic library support for dense and compressed sparse matrices. The first challenge in working with compressed matrices is how to set the nonzero entries in an efficient manner. The implementation in MTL4 does not need any pre-allocation or pre-sorting phase, uses a minimal amount of memory and was in all measures as fast or faster than comparable libraries. We demonstrate the performance on well-defined benchmarks.