hrcak mascot   Srce   HID

Izvorni znanstveni članak

A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix

A. Mahmood ; School of Electrical Engineering and Computer Science, Washington State University at Tri-Cities, Richland, U.S.A.
D. J. Lynch ; School of Electrical Engineering and Computer Science, Washington State University at Tri-Cities, Richland, U.S.A.
L. D. Philipp ; School of Electrical Engineering and Computer Science, Washington State University at Tri-Cities, Richland, U.S.A.

Puni tekst: engleski, pdf (4 MB) str. 15-24 preuzimanja: 294* citiraj
APA 6th Edition
Mahmood, A., J. Lynch, D. i D. Philipp, L. (1994). A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix. Journal of computing and information technology, 2 (1), 15-24. Preuzeto s https://hrcak.srce.hr/150477
MLA 8th Edition
Mahmood, A., et al. "A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix." Journal of computing and information technology, vol. 2, br. 1, 1994, str. 15-24. https://hrcak.srce.hr/150477. Citirano 01.11.2020.
Chicago 17th Edition
Mahmood, A., D. J. Lynch i L. D. Philipp. "A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix." Journal of computing and information technology 2, br. 1 (1994): 15-24. https://hrcak.srce.hr/150477
Harvard
Mahmood, A., J. Lynch, D., i D. Philipp, L. (1994). 'A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix', Journal of computing and information technology, 2(1), str. 15-24. Preuzeto s: https://hrcak.srce.hr/150477 (Datum pristupa: 01.11.2020.)
Vancouver
Mahmood A, J. Lynch D, D. Philipp L. A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix. Journal of computing and information technology [Internet]. 1994 [pristupljeno 01.11.2020.];2(1):15-24. Dostupno na: https://hrcak.srce.hr/150477
IEEE
A. Mahmood, D. J. Lynch i L. D. Philipp, "A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix", Journal of computing and information technology, vol.2, br. 1, str. 15-24, 1994. [Online]. Dostupno na: https://hrcak.srce.hr/150477. [Citirano: 01.11.2020.]

Sažetak
A new parallel algorithm (MIMD-PRAM class) having parallel time complexity of log2 n for computing the determinant of a tridiagonal matrix is developed. The algorithm is based on coupling the determinants of two neighboring submatrix blocks. With each coupling, the block size is increased by a factor of two until the entire determinant of an n x n matrix is found by the final coupling of two n/2 sized blocks. It is shown that the determinant of an n x n tridiagonal matrix can be computed in (3 log2 n - 2) parallel steps with a maximum parallel requirement of 7 ( n/4) + 3 processors. The algorithm achieves linear speedup as the number of processors is increased.

Ključne riječi
Determinant; Tridiagonal Matrix; Parallel Algorithm; MIMD; PRAM

Hrčak ID: 150477

URI
https://hrcak.srce.hr/150477

Posjeta: 360 *