PARALLEL COMPLEXITY OF LINEAR SYSTEM SOLUTION

by Bruno Codenotti, Mauro Leoncini

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 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 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).

228 pages, Paperback

First published May 1, 1991

About the author

Bruno Codenotti (Brescia, 1959) è direttore di ricerca presso l'Istituto di Informatica e Telematica del CNR di Pisa. Ha insegnato presso varie Università negli Stati Uniti e ha svolto attività di ricerca in informatica teorica e matematica computazionale.