Optimizing a parallel self-verified method for solving linear systems

Authors:
Mariana Kolberg;Lucas Baldo;Pedro Velho;Luiz Gustavo Fernandes;Dalcidio Claudio
Affiliations:
Faculdade de Informática, PUCRS, Porto Alegre, Brazil;Faculdade de Informática, PUCRS, Porto Alegre, Brazil;Faculdade de Informática, PUCRS, Porto Alegre, Brazil;Faculdade de Informática, PUCRS, Porto Alegre, Brazil;Faculdade de Informática, PUCRS, Porto Alegre, Brazil
Venue:
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Year:
2006

Citing 5
Cited 2

What do we need beyond IEEE arithmetic?

Computer arithmetic and self-validating numerical methods
MPI: The Complete Reference

MPI: The Complete Reference
C++ Toolbox for Verified Scientific Computing I: Basic Numerical Problems

C++ Toolbox for Verified Scientific Computing I: Basic Numerical Problems
C-XSC: A C++ Class Library for Extended Scientific Computing

C-XSC: A C++ Class Library for Extended Scientific Computing
Accurate Sum and Dot Product

SIAM Journal on Scientific Computing

Improving the Performance of a Verified Linear System Solver Using Optimized Libraries and Parallel Computation

High Performance Computing for Computational Science - VECPAR 2008
Solving dense interval linear systems with verified computing on multicore architectures

VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Solvers for linear equation systems are commonly used in many different kinds of real applications, which deal with large matrices. Nevertheless, two key problems appear to limit the use of linear system solvers to a more extensive range of real applications: computing power and solution correctness. In a previous work, we proposed a method that employs high performance computing techniques together with verified computing techniques in order to eliminate the problems mentioned above. This paper presents an optimization of a previously proposed parallel self-verified method for solving dense linear systems of equations. Basically, improvements are related to the way communication primitives were employed and to the identification of the points in the algorithm in which mathematical accuracy is needed to achieve reliable results.