Direct solvers

Abstract

We first discuss algorithms and software for the solution of full linear systems. In particular, we discuss work which aims to capitalize on recent advances in machine architectures while at the same time maintaining portability through the use of computational kernels. We then examine how this can be extended to the sparse case and consider several approaches for the direct solution of sparse linear equations including general methods based on Markowitz pivoting, frontal methods, and multifrontal methods.