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

ISSN： 1063-7192

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

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 BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix

By Climent J-J. Tortosa L. Zamora A.

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

Academic Press

Access to resources Recommend Favorite

An Efficient Parallel Algorithm to Solve Block–Toeplitz Systems

By Alonso P. Badía J. Vidal A.

The Journal of Supercomputing, Vol. 32, Iss. 3, 2005-06 ,pp. : 251-278

Springer Publishing Company

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

An iteration‐based hybrid parallel algorithm for tridiagonal systems of equations on multi‐core architectures

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 17, 2015-12 ,pp. : 5076-5095

John Wiley & Sons Inc

Access to resources Recommend Favorite

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

By Okumoto Kazumasa Fukunaga Takuro Nagamochi Hiroshi

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 787-806

Springer Publishing Company

Access to resources Recommend Favorite