Parallel complexity of linear system solution /

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

Full description

Saved in:
Bibliographic Details
Main Authors: Codenotti, Bruno. (Author)
Corporate Authors: World Scientific (Firm)
Group Author: Leoncini, Mauro.
Published: World Scientific Pub. Co.,
Publisher Address: Singapore ; Teaneck, N.J. :
Publication Dates: 1991.
Literature type: eBook
Language: English
Subjects:
Online Access: http://www.worldscientific.com/worldscibooks/10.1142/1287#t=toc
Summary: 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).
Carrier Form: 1 online resource (ix,218pages) : illustrations
Bibliography: Includes bibliographical references and index.
ISBN: 9789814360456 (electronic bk.)
Index Number: QA214
CLC: O151.1
Contents: 1. Introduction -- 2. Models of computation -- 3. Arithmetic circuits -- 4. PRAM algorithms -- 5. Distributed algorithms -- 6. VLSI networks.