登入選單

返回Google圖書搜尋

Parallel Complexity of Linear System Solution

Bruno CodenottiMauro Leoncini

出版	World Scientific, 1991
主題	Computers / Computer ScienceComputers / Programming / ParallelMathematics / Algebra / Elementary
ISBN	98102050319789810205034
URL	http://books.google.com.hk/books?id=-4ffbaW9OtkC&hl=&source=gbs_api
EBook	SAMPLE

註釋

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