Level-3 Cholesky Kernel Subroutine of a Fully Portable High Performance Minimal Storage Hybrid Format Cholesky Algorithm

The TOMS paper "A Fully Portable High Performance Minimal Sotrage Hybrid Format Cholesky Algorithm" by Andersen, Gunnels, Gustavson, Reid, and Wasniewski, used a level 3 Cholesky kernel subroutine instead of level 2 LAPACK routine _POTF2. We discuss the merits of this approach and show that its performance over _POTRF is consideraby improved on a variety of common platforms when _POTRF is soley restriced to calling _POTF2.

By: Fred G. Gustavson; Jerzy Wasniewski; Jack J. Dongarra

Published in: RC24727 in 2009


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .