State-of-The-Art Sparse Direct Solvers

In this chapter we will give an insight into modern sparse elimination methods. These are driven by a preprocessing phase based on combinatorial algorithms which improve diagonal dominance, reduce fill-in, and improve concurrency to allow for parallel treatment. Moreover, these methods detect dense...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-07
Main Authors: Bollhöfer, Matthias, Schenk, Olaf, Janalík, Radim, Hamm, Steve, Gullapalli, Kiran
Format: Article
Language:English
Subjects:
Algorithms
Combinatorial analysis
Computer simulation
Concurrency
Solvers
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this chapter we will give an insight into modern sparse elimination methods. These are driven by a preprocessing phase based on combinatorial algorithms which improve diagonal dominance, reduce fill-in, and improve concurrency to allow for parallel treatment. Moreover, these methods detect dense submatrices which can be handled by dense matrix kernels based on multithreaded level-3 BLAS. We will demonstrate for problems arising from circuit simulation, how the improvements in recent years have advanced direct solution methods significantly.
ISSN:2331-8422