Partitioning and reordering for spike-based distributed-memory parallel Gauss-Seidel
From MaRDI portal
Recommendations
- A distributed memory parallel Gauss-seidel algorithm for linear algebraic systems
- An iterative space alternate tiling parallel Gauss-Seidel algorithm
- \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
- A parallel multithreaded sparse triangular linear system solver
- Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
Cites work
- HSL_MI20 : An efficient AMG preconditioner for finite element problems in 3D
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- A distributed memory parallel Gauss-seidel algorithm for linear algebraic systems
- A domain-decomposing parallel sparse linear system solver
- A feature-complete SPIKE dense banded solver
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A hypergraph partitioning model for profile minimization
- A multithreaded recursive and nonrecursive parallel sparse direct solver
- A new parallel Gauss-Seidel method based on alternating group explicit method and domain decomposition method
- A Parallel Gauss–Seidel Method for Block Tridiagonal Linear Systems
- A parallel multithreaded sparse triangular linear system solver
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A synchronization-free algorithm for parallel sparse triangular solves
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- A Unified Proof for the Convergence of Jacobi and Gauss–Seidel Methods
- Acceleration of five-point red-black Gauss-Seidel in multigrid for Poisson equation
- An aggregation-based algebraic multigrid method
- An algebraic multigrid solver for Navier‐Stokes problems
- Analysis of the Truncated SPIKE Algorithm
- Benchmarking optimization software with performance profiles.
- Convergence of algebraic multigrid based on smoothed aggregation
- Direct Methods for Sparse Linear Systems
- Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
- scientific article; zbMATH DE number 417773 (Why is no real title available?)
- scientific article; zbMATH DE number 733664 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5049875 (Why is no real title available?)
- ILUT: A dual threshold incomplete LU factorization
- Is SOR Color-Blind?
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- On some parallel banded system solvers
- On two-dimensional sparse matrix partitioning: models, methods, and a recipe
- Ordering Schemes for Parallel Processing of Certain Mesh Problems
- Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
- Parallel Scientific Computation
- Practical Parallel Band Triangular System Solvers
- Preconditioning techniques for large linear systems: A survey
- Profile minimization problem for matrices and graphs
- Revisiting Hypergraph Models for Sparse Matrix Partitioning
- Scalable implementation of the parallel multigrid method on massively parallel computers
- Solving Triangular Systems on a Parallel Computer
- SPIKE: A parallel environment for solving banded linear systems
- SuperLU_DIST
- The bandwidths of a matrix. A survey of algorithms
- The parallel tiled WZ factorization algorithm for multicore architectures
- The University of Florida sparse matrix collection
Describes a project that uses
Uses Software
This page was built for publication: Partitioning and reordering for spike-based distributed-memory parallel Gauss-Seidel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065494)
