@MISC{Ele_sparselinear, author = {Algorithmique Parall Ele}, title = {SPARSE LINEAR ALGEBRA in and around the APO-ENSEEIHT-IRIT group}, year = {} }

Share

OpenURL

Abstract

We describe the work done in sparse linear algebra, in the "Algorithmique Parall`ele et Optimization" group of the ENSEEIHT-IRIT laboratory. The research activities, described in this paper, result from collaborations with CERFACS, RAL and University of FLorida. These include work on computational kernels for linear algebra, the solution of sparse systems by both direct and iterative methods, the study of element-by-element preconditionners. The objective of this paper is to describe the principal research themes explored in these area. We also comment on likely future developments. 1 Introduction We consider the solution of Ax = b; (1) where A is a large sparse matrix. If the matrix A is structured then it may be written as A = p X i=1 A i : (2) Sparse structured linear systems arise in many applications. The elementary matrices A i are usually full or nearly full matrices. Both classes of matrices (structured and unstructured) are being considered in our research studies...