A log/sub 2/n parallel algorithm for the determinant of a tridiagonal matrix

Autor:	A. Mahmood, D. J. Lynch, L. D. Philipp
Rok vydání:	2002
Předmět:	MIMD Matrix (mathematics) Tridiagonal matrix Computational complexity theory Computer science Computation Parallel algorithm Concurrent computing Tridiagonal matrix algorithm Parallel computing ComputerSystemsOrganization_PROCESSORARCHITECTURES Time complexity Matrix decomposition
Zdroj:	1991., IEEE International Sympoisum on Circuits and Systems.
DOI:	10.1109/iscas.1991.176005
Popis:	A new parallel algorithm is presented for computing the determinant of a tridiagonal matrix. The algorithm is based on a divide-and-conquer strategy and has a parallel time complexity of O(log/sub 2/n). The algorithm is adaptive and the effect of the available number of processors on the computation time is studied on a simulated MIMD static dataflow machine. >
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::59a62305163272605c9c167a245194b6 https://doi.org/10.1109/iscas.1991.176005 Zobrazit plný text záznamu