Year: 1991
Author: Ming-Kui Chen, Hao Lu
Journal of Computational Mathematics, Vol. 9 (1991), Iss. 1 : pp. 33–40
Abstract
A new parallel algorithm for inverting Toeplitz triangular matrices as well as solving Toeplitz triangular linear systems is presented in this paper. The algorithm possesses very good parallelism, which can easily be adjusted to match the natural hardware parallelism of the computer systems, that was assumed to be much smaller than the order $n$ of the matrices to be considered since this is the usual case in practical applications. The parallel time complexity of the algorithm is $O([n/p|\log n+\log^2p)$, where $p$ is the hardware parallelism.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1991-JCM-9376
Journal of Computational Mathematics, Vol. 9 (1991), Iss. 1 : pp. 33–40
Published online: 1991-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 8