By Topic

Parallel solution of bidiagonal systems coming from discretised PDEs

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
$31 $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

1 Author(s)
van der Vorst, H.A. ; Fac. of Math. & Inf., Delft Univ. of Technol., Netherlands

Standard algorithms for the solution of bidiagonal linear systems, which plays an important role in the numerical solution of discretized partial differential equations, are not very well suited for parallel or vector computers, and they often constitute a severe bottleneck on such machines. A number of parallel/vectorizable algorithms are considered. Performance limiting aspects of different (existing) architectures are considered, and it is shown that for many modern architectures suitable algorithms are presently available

Published in:

Magnetics, IEEE Transactions on  (Volume:24 ,  Issue: 1 )