By Topic

Concurrent iterative algorithm for Toeplitz-like linear systems

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)
Pan, V.Y. ; Dept. of Math. & Comput. Sci., City Univ. of New York, Bronx, NY, USA

A nonsingular n×n matrix A is given with its short displacement generator. It has small displacement rank bounded by a fixed constant. The class of such matrices generalizes Toeplitz matrices. A good initial approximation to a short displacement generator for A-1 is readily available. Ways to refine this approximation and numerically compute a displacement generator of A-1 and the solution vector x= A-1b to a linear system Ax=b by using O(log2n) parallel arithmetic steps and n processors are presented. These results are extended to some other important classes of dense structure matrices

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:4 ,  Issue: 5 )