The Community for Technology Leaders
RSS Icon
Issue No.12 - December (1988 vol.37)
pp: 1554-1568
Finite-element discretization produces linear equations in the form Ax=b, where A is large, sparse, and banded with proper ordering of the variables x. The solution of such equations on distributed-memory message-passing multiprocessors implementing the hypercube topology is addressed. Iterative algorithms based on the conjugate gradient method are developed for hypercubes designed for coarse-g
parallel algorithms; iterative algorithms; large sparse systems; linear equations; hypercubes; distributed-memory; message-passing multiprocessors; hypercube topology; conjugate gradient method; finite element analysis; iterative methods; linear algebra; parallel algorithms.
F. Ozguner, C. Aykanat, P. Sadayappan, "Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes", IEEE Transactions on Computers, vol.37, no. 12, pp. 1554-1568, December 1988, doi:10.1109/12.9733
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool