Change search
ReferencesLink to record
Permanent link

Direct link
Rectangular Full Packed Format for Cholesky's Algorithm: Factorization, Solution, and Inversion
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2010 (English)In: ACM Transactions on Mathematical Software, ISSN 0098-3500, Vol. 37, no 2, 1-21 p., 18Article in journal (Refereed) Published
Abstract [en]

We describe a new data format for storing triangular, symmetric, and Hermitian matrices called Rectangular Full Packed Format (RFPF). The standard two-dimensional arrays of Fortran and C (also known as full format) that are used to represent triangular and symmetric matrices waste nearly half of the storage space but provide high performance via the use of Level 3 BLAS. Standard packed format arrays fully utilize storage (array space) but provide low performance as there is no Level 3 packed BLAS. We combine the good features of packed and full storage using RFPF to obtain high performance via using Level 3 BLAS as RFPF is a standard full-format representation. Also, RFPF requires exactly the same minimal storage as packed the format. Each LAPACK full and/or packed triangular, symmetric, and Hermitian routine becomes a single new RFPF routine based on eight possible data layouts of RFPF. This new RFPF routine usually consists of two calls to the corresponding LAPACK full-format routine and two calls to Level 3 BLAS routines. This means no new software is required. As examples, we present LAPACK routines for Cholesky factorization, Cholesky solution, and Cholesky inverse computation in RFPF to illustrate this new work and to describe its performance on several commonly used computer platforms. Performance of LAPACK full routines using RFPF versus LAPACK full routines using the standard format for both serial and SMP parallel processing is about the same while using half the storage. Performance gains are roughly one to a factor of 43 for serial and one to a factor of 97 for SMP parallel times faster using vendor LAPACK full routines with RFPF than with using vendor and/or reference packed routines.

Place, publisher, year, edition, pages
2010. Vol. 37, no 2, 1-21 p., 18
Keyword [en]
Algorithms, Performance, Real symmetric matrices, complex Hermitian matrices, positive definite matrices, Cholesky factorization and solution, recursive algorithms, novel packed matrix data structures, LAPACK, Rectangular Full Packed Format, BLAS, linear algebra libraries
National Category
Computer Science
URN: urn:nbn:se:umu:diva-109712DOI: 10.1145/1731022.1731028ISI: 000277057400006OAI: diva2:858807
Available from: 2015-10-05 Created: 2015-10-05 Last updated: 2015-10-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Gustavson, Fred G.
By organisation
Department of Computing Science
In the same journal
ACM Transactions on Mathematical Software
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 20 hits
ReferencesLink to record
Permanent link

Direct link