State-of-the-art sparse direct solvers
From MaRDI portal
Publication:3300486
DOI10.1007/978-3-030-43736-7_1zbMATH Open1455.65003arXiv1907.05309OpenAlexW2961615917MaRDI QIDQ3300486FDOQ3300486
Authors: Matthias Bollhöfer, Olaf Schenk, Radim Janalik, Steve Hamm, Kiran Gullapalli 
Publication date: 29 July 2020
Published in: Parallel Algorithms in Computational Science and Engineering (Search for Journal in Brave)
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 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.
Full work available at URL: https://arxiv.org/abs/1907.05309
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)
Cites Work
- Title not available (Why is that?)
- An overview of SuperLU
- Direct Methods for Sparse Linear Systems
- Title not available (Why is that?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- The Evolution of the Minimum Degree Ordering Algorithm
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Approximate Minimum Degree Ordering Algorithm
- Title not available (Why is that?)
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- TWO THEOREMS IN GRAPH THEORY
- Title not available (Why is that?)
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- The Role of Elimination Trees in Sparse Factorization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preconditioning highly indefinite and nonsymmetric matrices
- Title not available (Why is that?)
- The elimination form of the inverse and its application to linear programming
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Parallel algorithms for bipartite matching problems on distributed memory computers
- A new pivoting strategy for Gaussian elimination
- Predicting Structure in Sparse Matrix Computations
Cited In (21)
- Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver
- Computational aspects of electromagnetic tomography
- Integrated nested Laplace approximations for large-scale spatiotemporal Bayesian modeling
- Optimization of random feature method in the high-precision regime
- Radial and three-dimensional nonlocal pseudopotential calculations in gradient-corrected Kohn-Sham density functional theory based on higher-order finite element methods
- Exploiting spatial symmetries for solving Poisson's equation
- Algorithm 907
- Parallelized integrated nested Laplace approximations for fast Bayesian inference
- Fill-ins number reducing direct solver designed for FIT-type matrix
- SlabLU: a two-level sparse direct solver for elliptic PDEs
- A generalization of the Riccati recursion for equality‐constrained linear quadratic optimal control
- Parallel Scalability of Three-Level FROSch Preconditioners to 220000 Cores using the Theta Supercomputer
- A simple model for arbitrary pollution effects on rotating free-surface flows
- Towards adaptive simulations of dispersive Tsunami propagation from an asteroid impact
- A three-level extension for fast and robust overlapping Schwarz (FROSch) preconditioners with reduced dimensional coarse space
- Sparsified block elimination for directed laplacians
- Title not available (Why is that?)
- A variational RVE-based multiscale poromechanical formulation applied to soft biological tissues under large deformations
- A robust and accurate adaptive approximation method for a diffuse-interface model of binary-fluid flows
- Combinatorial Aspects in Sparse Elimination Methods
- Improving the computational efficiency of solving multisource 3-D airborne electromagnetic problems in complex geological media
Uses Software
This page was built for publication: State-of-the-art sparse direct solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300486)
