State-of-the-art sparse direct solvers
From MaRDI portal
Publication:3300486
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 2087097 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A new pivoting strategy for Gaussian elimination
- An Approximate Minimum Degree Ordering Algorithm
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- An overview of SuperLU
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- Direct Methods for Sparse Linear Systems
- Parallel algorithms for bipartite matching problems on distributed memory computers
- Preconditioning highly indefinite and nonsymmetric matrices
- Predicting Structure in Sparse Matrix Computations
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- TWO THEOREMS IN GRAPH THEORY
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- The Evolution of the Minimum Degree Ordering Algorithm
- The Role of Elimination Trees in Sparse Factorization
- The elimination form of the inverse and its application to linear programming
Cited in
(22)- Exploiting spatial symmetries for solving Poisson's equation
- Improving the computational efficiency of solving multisource 3-D airborne electromagnetic problems in complex geological media
- Algorithm 907
- SlabLU: a two-level sparse direct solver for elliptic PDEs
- Parallel Scalability of Three-Level FROSch Preconditioners to 220000 Cores using the Theta Supercomputer
- Computational aspects of electromagnetic tomography
- A robust and accurate adaptive approximation method for a diffuse-interface model of binary-fluid flows
- Sparsified block elimination for directed laplacians
- A generalization of the Riccati recursion for equality‐constrained linear quadratic optimal control
- Integrated nested Laplace approximations for large-scale spatiotemporal Bayesian modeling
- Optimization of random feature method in the high-precision regime
- Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver
- Towards adaptive simulations of dispersive Tsunami propagation from an asteroid impact
- Radial and three-dimensional nonlocal pseudopotential calculations in gradient-corrected Kohn-Sham density functional theory based on higher-order finite element methods
- A simple model for arbitrary pollution effects on rotating free-surface flows
- Parallelized integrated nested Laplace approximations for fast Bayesian inference
- A three-level extension for fast and robust overlapping Schwarz (FROSch) preconditioners with reduced dimensional coarse space
- scientific article; zbMATH DE number 1728329 (Why is no real title available?)
- A variational RVE-based multiscale poromechanical formulation applied to soft biological tissues under large deformations
- Prestructuring sparse matrices with dense rows and columns via null space methods.
- Fill-ins number reducing direct solver designed for FIT-type matrix
- Combinatorial Aspects in Sparse Elimination Methods
Describes a project that uses
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)
