full
search.png

Search

close.png

Cancel

arrow
Volume 9, Issue 1
A Parallel Algorithm for Toeplitz Triangular Matrices

Ming-Kui Chen & Hao Lu

J. Comp. Math., 9 (1991), pp. 33-40.

Published online: 1991-09

Preview Full PDF 2627 27507

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-9-33, author = {Chen , Ming-Kui and Lu , Hao}, title = {A Parallel Algorithm for Toeplitz Triangular Matrices}, journal = {Journal of Computational Mathematics}, year = {1991}, volume = {9}, number = {1}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9376.html} }
TY - JOUR T1 - A Parallel Algorithm for Toeplitz Triangular Matrices AU - Chen , Ming-Kui AU - Lu , Hao JO - Journal of Computational Mathematics VL - 1 SP - 33 EP - 40 PY - 1991 DA - 1991/09 SN - 9 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9376.html KW - AB -

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.

Chen , Ming-Kui and Lu , Hao. (1991). A Parallel Algorithm for Toeplitz Triangular Matrices. Journal of Computational Mathematics. 9 (1). 33-40. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard