Parallel Complexity of Linear System Solution - Rilegato

Codenotti, Bruno; Leoncini, Mauro

 
9789810205027: Parallel Complexity of Linear System Solution

Sinossi

This book presents the most important parallel algorithms for the solution of linear systems. Despite the evolution and significance of the field of parallel solution of linear systems, no book is completely dedicated to the subject. People interested in the themes covered by this book belong to two different groups: numerical linear algebra and theoretical computer science, and this is the first effort to produce a useful tool for both. The book is organized as follows: after introducing the general features of parallel algorithms and the most important models of parallel computation, the authors analyze the complexity of solving linear systems in the circuit, PRAM, distributed, and VLSI models. The approach covers both the general case (i.e. dense linear systems without structure) and many important special cases (i.e. banded, sparse, Toeplitz, circulant linear systems).

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9789810205034: Parallel Complexity of Linear System Solution

Edizione in evidenza

ISBN 10:  9810205031 ISBN 13:  9789810205034
Casa editrice: World Scientific Pub Co Inc, 1991
Brossura