Novel Data Formats and Algorithms for Dense Linear Algebra Computations: Minisymposium Abstract

Abstract

Recently, recursion was introduced into the area of Dense Linear Algebra with the intent of producing new algorithms as well as improving its existing algorithms. Recursion, via the divide-and-conquer paradigm, introduced variable blocking to complement the standard fixed block algorithms. In particular, new data structures for dense linear algebra became an active research area. This minisymposium focuses on both new data structures and/or new or existing algorithms for high performing dense linear algebra algorithms.