Parallel Algorithms for Numerical Linear Algebra

Description

This is the first in a new series of books presenting research results and developments concerning the theory and applications of parallel computers, including vector, pipeline, array, fifth/future generation computers, and neural computers. All aspects of high-speed computing fall within the scope of the series, e.g. algorithm design, applications, software engineering, networking, taxonomy, models and architectural trends, performance, peripheral devices. Papers in Volume One cover the main streams of parallel linear algebra: systolic array algorithms, message-passing systems.;Front Cover; Parallel Algorithms for Numerical Linear Algebra; Copyright Page; Table of Contents; Preface; Part 1: Systolic array algorithms; Chapter 1. A quadratically convergent parallel Jacobi process for diagonally dominant matrices with distinct eigenvalues; 1. Introduction; 2. Parallel annihilators; the first step; 3. The effect of a complete sweep; 4. Numerical examples; 5. Conclusions; References; Chapter 2. A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil; 1. Introduction; 2. Normal pencils; 3. Description of the method; 4. Global convergence.