International audienceIn this paper, we present and analyze parallel substructuring methods based on conjugate gradient method, a iterative Krylov method, for solving sparse linear systems on GPUs. Numerical experiments performed on a set of matrices coming from the finite element analysis of large scale engineering problems, show the efficiency and robustness of substructuring methods based on iterative Krylov method for solving sparse linear systems in a context of a hybrid multi-core-GPU. © 2016 IEEE
We consider a fast, robust and scalable solver using graphic processing units (GPU) as accelerators ...
Abstract. The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In th...
Abstract. We present a new sparse linear solver for GPUs. It is designed to work with structured spa...
International audienceIn this paper, we present and analyze parallel substructuring methods based on...
International audienceIn this paper, we present and analyze parallel substructuring methods based on...
IEEE Computer SocietyInternational audienceThe main objective of this work consists in analyzing sub...
IEEE Computer SocietyInternational audienceThe main objective of this work consists in analyzing sub...
Abstract. Linear systems are required to solve in many scientific applications and the solution of t...
The research conducted in this thesis provides a robust implementation of a preconditioned iterative...
The research conducted in this thesis provides a robust implementation of a preconditioned iterative...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
We consider a fast, robust and scalable solver using graphic processing units (GPU) as accelerators ...
We consider a fast, robust and scalable solver using graphic processing units (GPU) as accelerators ...
Abstract. The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In th...
Abstract. We present a new sparse linear solver for GPUs. It is designed to work with structured spa...
International audienceIn this paper, we present and analyze parallel substructuring methods based on...
International audienceIn this paper, we present and analyze parallel substructuring methods based on...
IEEE Computer SocietyInternational audienceThe main objective of this work consists in analyzing sub...
IEEE Computer SocietyInternational audienceThe main objective of this work consists in analyzing sub...
Abstract. Linear systems are required to solve in many scientific applications and the solution of t...
The research conducted in this thesis provides a robust implementation of a preconditioned iterative...
The research conducted in this thesis provides a robust implementation of a preconditioned iterative...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems desc...
We consider a fast, robust and scalable solver using graphic processing units (GPU) as accelerators ...
We consider a fast, robust and scalable solver using graphic processing units (GPU) as accelerators ...
Abstract. The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In th...
Abstract. We present a new sparse linear solver for GPUs. It is designed to work with structured spa...