Sciweavers

52 search results - page 3 / 11
» pARMS: A Package for Solving General Sparse Linear Systems o...
Sort
View
PC
2002
118views Management» more  PC 2002»
13 years 5 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
PVM
1999
Springer
13 years 10 months ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova
HPCC
2007
Springer
13 years 9 months ago
Concurrent Number Cruncher: An Efficient Sparse Linear Solver on the GPU
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
Luc Buatois, Guillaume Caumon, Bruno Lévy
PPOPP
2009
ACM
14 years 6 months ago
Solving dense linear systems on platforms with multiple hardware accelerators
In a previous paper we show how the FLAME methods and tools provide a solution to compute dense dense linear algebra operations on a multi-GPU platform with reasonable performance...
Enrique S. Quintana-Ortí, Francisco D. Igua...
IPPS
2007
IEEE
14 years 3 days ago
A Parallel Hybrid Method of GMRES on GRID System
Grid computing focuses on making use of a very large amount of resources from a large-scale computing environment. It intends to deliver high-performance computing over distribute...
Ye Zhang, Guy Bergére, Serge G. Petiton