By Topic

Efficient parallel processing technique for inverting matrices with random sparsity

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 $33
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)
R. Betancourt ; San Diego State University, College of Engineering, Department of Electrical and Computer Engineering, San Diego, USA

Algorithms for ordering a sparse matrix A for parallel triangular factorisation and for obtaining the parallel inverse of A are given. The heuristic ordering method is based on graph manipulations. It attempts to minimise the completion time of parallel triangular factorisation while preserving the sparsity of the matrix. The inversion method proposed is based on the triangular factors of A. The task of obtaining the `sparse inverse¿¿of A is represented by a directed acyclic graph. The algorithm and the graph for the full inversion of A are also given. Claims are substantiated by experiments using test data from several electric networks.

Published in:

IEE Proceedings E - Computers and Digital Techniques  (Volume:133 ,  Issue: 4 )