A New Method for Solving Triangular Systems on Distributed Memory Message-Passing Multiprocessors
| dc.contributor.author | Li, Guangye | en_US |
| dc.contributor.author | Coleman, Thomas F. | en_US |
| dc.date.accessioned | 2007-04-23T17:18:15Z | |
| dc.date.available | 2007-04-23T17:18:15Z | |
| dc.date.issued | 1987-03 | en_US |
| dc.description.abstract | Efficient triangular solvers for use on message passing multiprocessors are required, in several contexts, under the assumption that the matrix is distributed by columns (or rows) in a wrap fashion. In this paper we describe a new efficient parallel triangular solver for this problem. This new algorithm is based on the previous method of Li and Coleman [1986] but is considerably more efficient when $\frac{n}{p}$ is relatively modest, where $p$ is the number of processors and $n$ is the problem dimension. A useful theoretical analysis is provided as well as extensive numerical results obtained on an Intel iPSC with $p \leq 128$. | en_US |
| dc.format.extent | 1817311 bytes | |
| dc.format.extent | 509343 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-812 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6652 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A New Method for Solving Triangular Systems on Distributed Memory Message-Passing Multiprocessors | en_US |
| dc.type | technical report | en_US |