By Topic

Parallel Inversion of Sparse Matrices.

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

2 Author(s)
Betancourt, R. ; San Diego State University San Diego, California ; Alvarado, F.L.

This paper presents a parallel algorithm for obtaining the inverse of a large, nonsingular symmetric matrix A of dimension nxn. 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 relation between the triangulation graph and the sparse inversion graph is given. The algorithm and the graph for the full inversion of A is also given. It is shown that for any sparse symmetric matrix, and assuming enough processors are available, the full inverse of the matrix can be calculated in the same amount of time as the sparse inverse. For ideally sparse matrices (such as tridiagonal matrices) the order of computation required in both cases is of order log2n. For full matrices the order of computation is n log2n. Claims are substantiated using test data from several power systems.

Published in:

Power Systems, IEEE Transactions on  (Volume:1 ,  Issue: 1 )