Parallel complexity for solving tridiagonal linear systems with multiple right-hand sides on 2-D torus interconnection networks

E. S. Santos, E. S. Santos, E. Santos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Precise upper and lower bounds on running time are derived for the problem of solving tridiagonal linear systems with multiple RHS vectors on 2-dimensional torus interconnection networks. We present various important lower bounds on execution time for solving these systems utilizing odd-even cyclic reduction. Furthermore, algorithms are designed in order to achieve running times that are within a small constant factor of the lower bounds provided.

Original languageEnglish (US)
Title of host publicationProceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages607-612
Number of pages6
ISBN (Electronic)0769505902, 9780769505909
DOIs
StatePublished - Jan 1 2000
Externally publishedYes
Event4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 - Beijing, China
Duration: May 14 2000May 17 2000

Publication series

NameProceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
Volume2

Conference

Conference4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
CountryChina
CityBeijing
Period5/14/005/17/00

Keywords

  • linear algebra
  • numerical computing
  • parallel algorithms
  • parallel complexity
  • torus networks
  • tridiagonal solvers

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Parallel complexity for solving tridiagonal linear systems with multiple right-hand sides on 2-D torus interconnection networks'. Together they form a unique fingerprint.

Cite this