Přístupnostní navigace
E-application
Search Search Close
Publication detail
POLOK, L. ILA, V. SMRŽ, P.
Original Title
Cache Efficient Implementation for Block Matrix Operations
Type
article in a collection out of WoS and Scopus
Language
English
Original Abstract
Efficiently manipulating and operating on block matrices can be beneficial in many applications, among others those involving iteratively solving nonlinear systems. These types of problems consist of repeatedly assembling and solving sparse linear systems. In the case of very large systems, without a careful manipulation of the corresponding matrices, solving can become very time consuming. This paper proposes a memory storage scheme convenient for both, numeric and structural matrix modification and, at the same time, allowing efficient arithmetic operation. This scheme was used in the implementation of a simple BLAS-like library. The advantage of the new scheme is demonstrated through exhaustive tests on the popular University of Florida Sparse Matrix Collection. Furthermore, this library was used in solving several nonlinear graph optimization problems.
Keywords
block matrix, high performance, sparse BLAS, nonlinear least squares
Authors
POLOK, L.; ILA, V.; SMRŽ, P.
RIV year
2013
Released
7. 4. 2013
Publisher
Association for Computing Machinery
Location
San Diego
ISBN
1-56555-350-0
Book
Proceedings of the 21st High Performance Computing Symposium (HPC'13)
Pages from
698
Pages to
706
Pages count
8
URL
http://dl.acm.org/citation.cfm?id=2499972
BibTex
@inproceedings{BUT103462, author="Lukáš {Polok} and Viorela Simona {Ila} and Pavel {Smrž}", title="Cache Efficient Implementation for Block Matrix Operations", booktitle="Proceedings of the 21st High Performance Computing Symposium (HPC'13)", year="2013", pages="698--706", publisher="Association for Computing Machinery", address="San Diego", isbn="1-56555-350-0", url="http://dl.acm.org/citation.cfm?id=2499972" }