Parallel Complexity Of Linear System Solution

Bruno Codenotti, Mauro Leoncini

• Publisher: World Scientific
• Year: 1991
• Print ISBN: 9789810205027, 9789810205027
• eBook ISBN: 9789814360456
• Topic: Computer Science
• Subtopic: Computer Science General
• Index: Computer Science

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

Table of contents

• Table of Contents
• Preface
• Notations
• Chapter 1 Introduction
• Chapter 2 Models of Computation
• Chapter 3 Arithmetic Circuits
• Chapter 4 PRAM Algorithms
• Chapter 5 Distributed Algorithms
• Chapter 6 VLSI Networks
• Bibliography
• Subject Index