Introduction to Parallel and Vector Solution of Linear Systems


Book Description

Although the origins of parallel computing go back to the last century, it was only in the 1970s that parallel and vector computers became available to the scientific community. The first of these machines-the 64 processor llliac IV and the vector computers built by Texas Instruments, Control Data Corporation, and then CRA Y Research Corporation-had a somewhat limited impact. They were few in number and available mostly to workers in a few government laboratories. By now, however, the trickle has become a flood. There are over 200 large-scale vector computers now installed, not only in government laboratories but also in universities and in an increasing diversity of industries. Moreover, the National Science Foundation's Super computing Centers have made large vector computers widely available to the academic community. In addition, smaller, very cost-effective vector computers are being manufactured by a number of companies. Parallelism in computers has also progressed rapidly. The largest super computers now consist of several vector processors working in parallel. Although the number of processors in such machines is still relatively small (up to 8), it is expected that an increasing number of processors will be added in the near future (to a total of 16 or 32). Moreover, there are a myriad of research projects to build machines with hundreds, thousands, or even more processors. Indeed, several companies are now selling parallel machines, some with as many as hundreds, or even tens of thousands, of processors.










NASA Technical Paper


Book Description







Numerical Analysis


Book Description

This book introduces students with diverse backgrounds to various types of mathematical analysis that are commonly needed in scientific computing. The subject of numerical analysis is treated from a mathematical point of view, offering a complete analysis of methods for scientific computing with appropriate motivations and careful proofs. In an engaging and informal style, the authors demonstrate that many computational procedures and intriguing questions of computer science arise from theorems and proofs. Algorithms are presented in pseudocode, so that students can immediately write computer programs in standard languages or use interactive mathematical software packages. This book occasionally touches upon more advanced topics that are not usually contained in standard textbooks at this level.




Iterative Methods for Sparse Linear Systems


Book Description

Since the first edition of this book was published in 1996, tremendous progress has been made in the scientific and engineering disciplines regarding the use of iterative methods for linear systems. The size and complexity of the new generation of linear and nonlinear systems arising in typical applications has grown. Solving the three-dimensional models of these problems using direct solvers is no longer effective. At the same time, parallel computing has penetrated these application areas as it became less expensive and standardized. Iterative methods are easier than direct solvers to implement on parallel computers but require approaches and solution algorithms that are different from classical methods. Iterative Methods for Sparse Linear Systems, Second Edition gives an in-depth, up-to-date view of practical algorithms for solving large-scale linear systems of equations. These equations can number in the millions and are sparse in the sense that each involves only a small number of unknowns. The methods described are iterative, i.e., they provide sequences of approximations that will converge to the solution.




Solving Differential Equations by Multistep Initial and Boundary Value Methods


Book Description

The numerical approximation of solutions of differential equations has been, and continues to be, one of the principal concerns of numerical analysis and is an active area of research. The new generation of parallel computers have provoked a reconsideration of numerical methods. This book aims to generalize classical multistep methods for both initial and boundary value problems; to present a self-contained theory which embraces and generalizes the classical Dahlquist theory; to treat nonclassical problems, such as Hamiltonian problems and the mesh selection; and to select appropriate methods for a general purpose software capable of solving a wide range of problems efficiently, even on parallel computers.




Parallel Complexity of Linear System Solution


Book Description

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




Complex Systems


Book Description

Over the past few years the study of Complex Systems has proven to be a fruitful and expanding field of research. Just as the number of discoveries and applications has grown, so has level of acceptance in academic, government and commercial environments. Theoretical and practical contributions to research have continued to provide a springboard for wide ranging discoveries across many disciplines investigating complex phenomena. This is the third in a series of collected studies on complexity research. This volume addresses one of the central issues of complexity. That is, how are systems put together? How do interactions between individual elements build up into the behavior or properties of an entire system? The topics are: - Organization and Behavior of Computational Systems; - Criticality and Complexity; - Nonlinear Dynamics and Fractals; - Computational Problem Solving with Genetic Algorithms and Cellular Automata; - Evolution, Learning and Artificial Neural Networks; - From Biological Systems to Artificial Life.