High Performance Algorithms for Structured Matrix Problems

Front Cover
Peter Arbenz
Nova Science, 1998 - Computers - 203 pages
0 Reviews
The main aim of this volume is to summarise the state of the art in the area of high performance solutions of structured linear systems as well as the area of structured eigenvalue and singular-value problems. The volume highlights research directions perceived to be the most important for computing the structured problems. The topics covered range from parallel solvers for sparse or banded linear systems to parallel computation of eigenvalues and singular values of tridiagonal and bidiagonal matrices. In addition, the volume contains articles on specialised solution techniques for dense Toeplitz and Hankel matrices. The papers also discuss implementation issues on numerous parallel architectures such as vector computers, shared and distributed memory multiprocessors, and clusters of workstations.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


A Comparison of Frontal Software with other Harwell Subroutine
Algorithms Applications
On the Stable Parallel Solution of General Narrow Banded

6 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information