State-of-The-Art Sparse Direct Solvers

07/11/2019
by   Matthias Bollhöfer, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 19

09/25/2015

Analysis of A Splitting Approach for the Parallel Solution of Linear Systems on GPU Cards

We discuss an approach for solving sparse or dense banded linear systems...
10/13/2017

On Parallel Solution of Sparse Triangular Linear Systems in CUDA

The acceleration of sparse matrix computations on modern many-core proce...
07/17/2020

Computing stable resultant-based minimal solvers by hiding a variable

Many computer vision applications require robust and efficient estimatio...
02/11/2020

Direct Solution of FEM Models: Are Sparse Direct Solvers the Best Strategy?

A brief summary of direct solution approaches for finite element methods...
02/11/2020

Parallel Direct Domain Decomposition Methods (D3M) for Finite Elements

A parallel direct solution approach based on domain decomposition method...
08/20/2017

Multiparameter spectral analysis for aeroelastic instability problems

This paper presents a novel application of multiparameter spectral theor...
05/01/2019

High-performance sampling of generic Determinantal Point Processes

Determinantal Point Processes (DPPs) were introduced by Macchi as a mode...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.