The selection of the best method and preconditioner for solving a sparse linear system is as
determinant as the efficient parallelization of the selected method. We propose a tool for …

In this paper, a tool for predicting and visualizing the performance of iterative methods is
presented. These codes come from an exhaustive parallel library of sparse iterative methods …

Procedural languages like C and FORTRAN have historically been the languages of choice
for implementing programs for high performance parallel computers. This dissertation is an …

The significant gap between peak and realized performance of parallel systems motivates
the need for performance analysis. In order to predict the performance of a class of parallel …

In this paper, an exhaustive parallel library of sparse iterative methods and preconditioners
in HPF and MPI was developed, and a model for predicting the performance of these codes …

Tesis “Desarrollar un código de solvers directos para ser usados en simulaciones de elementos
finitos.” por Jaime Alexander Arévalo Bueno Tesis propuesta para el master en METODOS …

Creating a computer program involves the repeated refinement of a problem statement and
its semantic context into new contexts until the problem has been expressed in source code …

In this paper, a tool for predicting and visualizing the performance of iterative methods is
presented. These codes come from an exhaustive parallel library of sparse iterative methods …

In many numerical simulation and modeling problems, the most CPU consuming part of the
computation is to solve some large sparse linear systems, in the form of Ax= b. For solving …