High performance algorithms for structured matrix problems
Author(s)
Bibliographic Information
High performance algorithms for structured matrix problems
(Advances in the theory of computation and computational mathematics / edited by Lee L. Keener, v. 2)
Nova Science Publishers, c1998
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Other editors: Marcin Paprzycki, Ahmed Sameh, Vivek Sarin
Includes bibliographical references and index
Description and Table of Contents
Description
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.
by "Nielsen BookData"