Neville elimination on multi- and many-core systems: OpenMP, MPI and CUDA
Departamento de Matematicas, Universidad de Oviedo, Oviedo, Spain
The Journal of Supercomputing
This paper describes several parallel algorithmic variations of the Neville elimination. This elimination solves a system of linear equations making zeros in a matrix column by adding to each row an adequate multiple of the preceding one. The parallel algorithms are run and compared on different multi- and many-core platforms using parallel programming techniques as MPI, OpenMP and CUDA.
January 10, 2011 by hgpu