Recent Advances in Dense Linear Algebra: Minisymposium Abstract

摘要

These last past years have seen a tremendous amount of new results in computational dense linear algebra. New algorithms have been developed to increase the speed of convergence of eigensolvers, to improve the final accuracy of solvers, to improve the parallel efficiency of applications, and to harness even better the capability of our computing platforms. Of particular interest for this minisymposium are new algorithms that outperform the algorithms used in Sca/LAPACK’s current routines or match expected new functionality of the library.