Solvers for triangular systems on k-dimensional torus networks

Eunice E. Santos, Eugene S. Santos

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

Abstract

A variety of bounds on running time are proven in this paper for the problem of solving triangular linear systems on a k-Dimensional torus. The bounds are applicable for solvers utilizing the substitution method. Both upper and lower bounds are provided in order to determine the overall Parallel complexity of the problem.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2003
EditorsH.R. Arabnia, Y. Mun, H.R. Arabnia, Y. Mun
Pages544-549
Number of pages6
StatePublished - 2003
Externally publishedYes
EventProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Las Vegas, NV, United States
Duration: Jun 23 2003Jun 26 2003

Publication series

NameProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
Volume2

Conference

ConferenceProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
Country/TerritoryUnited States
CityLas Vegas, NV
Period6/23/036/26/03

Keywords

  • K-dimensional torus networks
  • Linear algebra
  • Parallel algorithms and complexity
  • Triangular solvers

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Solvers for triangular systems on k-dimensional torus networks'. Together they form a unique fingerprint.

Cite this