2019
DOI: 10.48550/arxiv.1907.05309
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

State-of-The-Art Sparse Direct Solvers

Abstract: 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 multi-threaded level-3 BLAS. We will demonstrate for problems arising from circuit simulation how the improvement in recent years have advanced direct… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…We build our contribution on the following observation: Practitioners, in particular in the modeling community, often rely on sparse direct solvers for the (linearized) subproblems, e.g., Umfpack, Pardiso and SuperLU, see [4] for an overview. This holds when Matlab's Backslash operator or its equivalent in SciPy are used, as they translate to one of these sparse direct solvers under the hood.…”
Section: Introductionmentioning
confidence: 99%
“…We build our contribution on the following observation: Practitioners, in particular in the modeling community, often rely on sparse direct solvers for the (linearized) subproblems, e.g., Umfpack, Pardiso and SuperLU, see [4] for an overview. This holds when Matlab's Backslash operator or its equivalent in SciPy are used, as they translate to one of these sparse direct solvers under the hood.…”
Section: Introductionmentioning
confidence: 99%