By Topic

Parallel and vectorial solving of finite element problems on a shared-memory multiprocessor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. Magnin ; Lab. d'Electrotech. de Grenoble, ENSIEG, St. Martin d'Heres, France ; J. L. Coulomb ; R. Perrin-Bit

Some alternatives for speeding up finite-element computations by use of a vector-parallel shared memory multiprocessor are presented. The whole solution process is dealt with, including the calculation of element contributions (integration), global matrix construction (assembly), and resolution of the large sparse linear systems thus arising. The vector-parallel algorithms are implemented and compared on an Alliant FX/80, providing an automatic compiler, thus making parallel programming easier. The best choice between the possible combinations of the algorithms presented is discussed, considering the global performances. The ICCG (incomplete Cholesky preconditioned conjugate gradient) method, associated with parallel assembly and vectorial integration on finite elements, is the best for smooth problems. With nearly singular matrices, or when a smaller residual on the solution is needed, the direct method gives less time-expensive solutions

Published in:

IEEE Transactions on Magnetics  (Volume:28 ,  Issue: 2 )