A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix

Author： Climent J-J.   Tortosa L.   Zamora A.  

Publisher： Academic Press

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.59, Iss.3, 1999-12, pp. : 423-444

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A parallel divide and conquer algorithm for non symmetric tridiAgonal toeplitz systems using conjugate gradient

By Garey L.E.   Shaw* R.E.   Zhang J.  

Parallel Algorithms and Applications, Vol. 17, Iss. 4, 2002-01 ,pp. : 249-262

Taylor & Francis Ltd

Access to resources Recommend Favorite

A two-way BSP algorithm for tridiagonal systems

By Huang Y.   McColl W.F.  

Future Generation Computer Systems, Vol. 13, Iss. 4, 1998-03 ,pp. : 337-347

Elsevier

Access to resources Recommend Favorite

Divide-and-conquer algorithms on the hypercube

By Mayr E.W.   Werchner R.  

Theoretical Computer Science, Vol. 162, Iss. 2, 1996-08 ,pp. : 283-296

Elsevier

Access to resources Recommend Favorite

A recursive partitioning algorithm for matrix inversion on parallel computers

By Östermark Ralf  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 27, Iss. 5, 1998-05 ,pp. : 496-510

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers: Parallel and Distributed Processing with Applications (Guest Editor: Minyi Guo)

By Wang Hui   Guo Minyi   Wei Daming  

The Journal of Supercomputing, Vol. 29, Iss. 2, 2004-08 ,pp. : 157-170

Springer Publishing Company

Access to resources Recommend Favorite