GPU computing with Kaczmarz's and other iterative algorithms for linear systems
From MaRDI portal
Publication:991101
DOI10.1016/j.parco.2009.12.003zbMath1204.68260OpenAlexW2088481815WikidataQ40830601 ScholiaQ40830601MaRDI QIDQ991101
Joseph M. Elble, Nikolaos V. Sahinidis, Panagiotis Vouzis
Publication date: 2 September 2010
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2879082
Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Computer system organization (68M99) Numerical linear algebra (65F99)
Related Items
Accelerating parallel particle swarm optimization via GPU ⋮ Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration ⋮ On randomized partial block Kaczmarz method for solving huge linear algebraic systems ⋮ CADD: a seamless solution to the domain decomposition problem of subdomain boundaries and cross-points ⋮ On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems ⋮ GPU implementation of a Helmholtz Krylov solver preconditioned by a shifted Laplace multigrid method ⋮ GPU accelerated computation of the isogeometric analysis stiffness matrix ⋮ A new era in scientific computing: domain decomposition methods in hybrid CPU-GPU architectures ⋮ GPU-acceleration of stiffness matrix calculation and efficient initialization of EFG meshless methods ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ A geometric probability randomized Kaczmarz method for large scale linear systems ⋮ On the error estimate of the randomized double block Kaczmarz method ⋮ A GPU domain decomposition solution for spectral stochastic finite element method ⋮ On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
Uses Software
Cites Work
- Unnamed Item
- CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs
- Domain decomposition for parallel row projection algorithms
- A Randomized Solver for Linear Systems with Exponential Convergence
- A Block Projection Method for Sparse Matrices
- Row Projection Methods for Large Nonsymmetric Linear Systems
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Distributed Schur Complement Techniques for General Sparse Linear Systems
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations
- Methods of conjugate gradients for solving linear systems
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems