Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel
DOI10.1137/21M1411603OpenAlexW4220686258WikidataQ114074057 ScholiaQ114074057MaRDI QIDQ5065494
Cevdet Aykanat, Murat Manguoglu, Tugba Torun, F. Sukru Torun
Publication date: 22 March 2022
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1411603
hypergraph partitioningdistributed-memorysparse matrix reorderingparallel Gauss-Seidelparallel sparse triangular solvespike algorithm
Computational methods for sparse matrices (65F50) Hypergraphs (05C65) Parallel algorithms in computer science (68W10) Iterative numerical methods for linear systems (65F10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- An aggregation-based algebraic multigrid method
- A domain-decomposing parallel sparse linear system solver
- SPIKE: A parallel environment for solving banded linear systems
- A distributed memory parallel Gauss-seidel algorithm for linear algebraic systems
- On some parallel banded system solvers
- Profile minimization problem for matrices and graphs
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- Acceleration of five-point red-black Gauss-Seidel in multigrid for Poisson equation
- Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
- A synchronization-free algorithm for parallel sparse triangular solves
- Preconditioning techniques for large linear systems: A survey
- Scalable implementation of the parallel multigrid method on massively parallel computers
- A parallel multithreaded sparse triangular linear system solver
- The parallel tiled WZ factorization algorithm for multicore architectures
- A new parallel Gauss-Seidel method based on alternating group explicit method and domain decomposition method
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- Finite Elements and Fast Iterative Solvers
- A Multithreaded Recursive and Nonrecursive Parallel Sparse Direct Solver
- The Bandwidths of a Matrix. A Survey of Algorithms
- The university of Florida sparse matrix collection
- On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
- Direct Methods for Sparse Linear Systems
- Analysis of the Truncated SPIKE Algorithm
- Ordering Schemes for Parallel Processing of Certain Mesh Problems
- Is SOR Color-Blind?
- Solving Triangular Systems on a Parallel Computer
- Practical Parallel Band Triangular System Solvers
- An algebraic multigrid solver for Navier‐Stokes problems
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Hypergraph Partitioning Model for Profile Minimization
- A Unified Proof for the Convergence of Jacobi and Gauss–Seidel Methods
- A Parallel Gauss–Seidel Method for Block Tridiagonal Linear Systems
- ILUT: A dual threshold incomplete LU factorization
- A Feature-complete SPIKE Dense Banded Solver
- Parallel Scientific Computation
- Efficient Low-Order Refined Preconditioners for High-Order Matrix-Free Continuous and Discontinuous Galerkin Methods
- HSL_MI20 : An efficient AMG preconditioner for finite element problems in 3D
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Revisiting Hypergraph Models for Sparse Matrix Partitioning
- SuperLU_DIST
- Convergence of algebraic multigrid based on smoothed aggregation
- Benchmarking optimization software with performance profiles.
This page was built for publication: Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel
