Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

The CCM based implementation of the parallel variant of BiCG algorithm suitable for massively parallel computing

Authors

[ 1 ] Instytut Automatyki i Inżynierii Informatycznej, Wydział Elektryczny, Politechnika Poznańska | [ P ] employee

Year of publication

2006

Chapter type

paper

Publication language

english

Abstract

EN The paper presents the implementation of a method for solving the large sparse non-symmetric linear system on the CCM class parallel machine. The method is an adaptation of the well-known biconjugate gradient algorithm. The equations solved results from the FEM based computations of the 3D electromagnetic field with a motion taken into account.

Pages (from - to)

301 - 306

DOI

10.1109/PARELEC.2006.76

URL

https://ieeexplore.ieee.org/document/1698678

Book

PARELEC 2006 : International Conference on Parallel Computing in Electrical Engineering : 13-17 September, 2006, Bialystok, Poland

Presented on

International Conference on Parallel Computing in Electrical Engineering, PARELEC 2006, 13-17.09.2006, Białystok, Polska

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.