State-of-the-Art Sparse Direct Solvers
From MaRDI portal
Publication:3300486
DOI10.1007/978-3-030-43736-7_1zbMath1455.65003arXiv1907.05309OpenAlexW2961615917MaRDI QIDQ3300486
Olaf Schenk, Radim Janalik, Steve Hamm, Matthias Bollhöfer, Kiran Gullapalli
Publication date: 29 July 2020
Published in: Parallel Algorithms in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.05309
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Parallelized integrated nested Laplace approximations for fast Bayesian inference, Parallel Scalability of Three-Level FROSch Preconditioners to 220000 Cores using the Theta Supercomputer, Computational aspects of electromagnetic tomography, Exploiting spatial symmetries for solving Poisson's equation, A generalization of the Riccati recursion for equality‐constrained linear quadratic optimal control, Towards adaptive simulations of dispersive Tsunami propagation from an asteroid impact, A variational RVE-based multiscale poromechanical formulation applied to soft biological tissues under large deformations, Radial and three-dimensional nonlocal pseudopotential calculations in gradient-corrected Kohn-Sham density functional theory based on higher-order finite element methods, Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver, Improving the computational efficiency of solving multisource 3-D airborne electromagnetic problems in complex geological media, A robust and accurate adaptive approximation method for a diffuse-interface model of binary-fluid flows, A simple model for arbitrary pollution effects on rotating free-surface flows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel algorithms for bipartite matching problems on distributed memory computers
- A new pivoting strategy for Gaussian elimination
- Preconditioning Highly Indefinite and Nonsymmetric Matrices
- The Elimination form of the Inverse and its Application to Linear Programming
- TWO THEOREMS IN GRAPH THEORY
- Direct Methods for Sparse Linear Systems
- The Role of Elimination Trees in Sparse Factorization
- An overview of SuperLU
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- The Evolution of the Minimum Degree Ordering Algorithm
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Predicting Structure in Sparse Matrix Computations
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- An Approximate Minimum Degree Ordering Algorithm
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
