Parallel Complexity Of Linear System Solution - Softcover

Codenotti, Bruno; Leoncini, Mauro

Softcover

ISBN 10: 9810205031 ISBN 13: 9789810205034

Publisher: World Scientific Publishing Co Pte Ltd, 1991

Synopsis

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

About this title

Synopsis

Two computer scientists from the Italian National Research Council explain the process of solving linear systems in some different models of parallel computation. Their point is to allow researchers and graduates in computer science and numerical analysis to become familiar with many different facets of parallelism. Acidic paper. Paper edition (uns

Edition details

• Publisher: World Scientific Publishing Co Pte Ltd
• Publication date: 1991
• Language: English
• ISBN 10: 9810205031
• ISBN 13: 9789810205034
• Binding: Paperback
• Number of pages: 228