Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B. The bit-cost of some algorithms for the solution of linear systems. In: Computers and Mathematics with Applications, vol. 15 (11) pp. 933 - 937. Pergamon Press, 1988.
We present an analysis of the bit-cost of some numericallinear system solvers. We use measures of the computational cost of algorithms, which are deeply related to their numerical behaviour. We derive upper bounds to the worst case bit-performance of the Gaussian e1imination, Jacobi's and Newton's methods, implemented either in a sequential or in a parallel environment. Moreover, we analyze an interesting special case, c.g. the solution of triangular Toeplitz linear systems.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional