From: william.gilreath@usm.edu (William F. Gilreath)
Newsgroups: comp.parallel
Subject: Book Annoucement: High Performance Algorithms for Structured Matrix
Date: 5 May 1999 03:40:35 GMT
Organization: University of Southern Mississippi,
Approved: bigrigg@cs.cmu.edu
Message-Id: <7goejj$m83$1@goldenapple.srv.cs.cmu.edu>
Originator: bigrigg@ux6.sp.cs.cmu.edu
Xref: ukc comp.parallel:15559


HIGH PERFORMANCE ALGORITHMS FOR STRUCTURED MATRIX PROBLEMS

Edited by: Peter Arbenz, Marcin Paprzycki, Ahmed H. Sameh, Vivek Sarin

Volume II in the Series:

Advances in the Theory of Computation and Computational
Mathematics
http://orca.st.us.edu/actp
ISBN 1-56072-594-X


The main aim of this volume is to summarize 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 specialized 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.

*****************************************************************

Contents (abstracts will be posted soon on the ACTP WWW site):

Introduction
P. Arbenz (ETH Zurich), M. Paprzycki (University of Southern
Mississippi),
A. Sameh and V. Sarin (Purdue University)

Part I
Linear System Solvers

A Comparison of Frontal Software with other Harwell Subroutine Library
Sparse DIrect Solvers
I.F. Duff and J.A. Scott (Rutherford Appleton Laboratory)

Sparse Matrix Bandwidth Reduction: Algoithms, Applications and Real
Industrial Cases in Electromagnetics
A. Esposito, M.S.F. Catalano, F. Malucelli and L. Tarricone
(University of Perugia)

On the Stable Parallel Solution of General Narrow Banded Linear
Systems
P. Arbenz (ETH Zurich) and M. Hegland (Australian National University)

Part II
Eigenvalue Problems

Efficient Algorithms for Reducing Banded Matrices to Bidiagonal and
Tridiagonal Form
B. Lang (Bergische University Wuppertal)

Parallel bisection algorithms for solving the symmetric tridiagonal
eigenproblem
J. M. Bad=EDa (University Jaume I. Castell=F3n)  and A. M. Vidal
(Technical University Valencia)

A Parallel OR Algorithm for the Symmetric Tridiagonal Eigenvlue
Problem
I. Bar-On (Technion University)

Part III
Matrices with Special Structure

A Numerical Cmparison of Look-Ahead Levinson and Schur ALgorithms for
Non-Hermitian Toeplitz Systems
M. Hochbruck (University of Tubingen)

Superfast Solution of Linear Equations with Low Displacement Rank
T. Huckle (Technical University Munich)

Part IV
Parallel Computation

Load Balance in Parallel FACR
L.S. Johnsson and N.P. Pitsianis (University of Houston)

Parallel CG-Methods - Automaticallu Optimized for PC- and Workstation
Clusters
J. Eisenbiegler, J. Gottlieb, W. Lowe, S. Schlaeger, M Thul and W.
Zimmermann (University of Karlsruhe)

--
Articles to bigrigg+parallel@cs.cmu.edu (Admin: bigrigg@cs.cmu.edu)
Archive: http://www.hensa.ac.uk/parallel/internet/usenet/comp.parallel