The Community for Technology Leaders
Green Image
<p>A nonsingular n*n matrix A is given with its short displacement generator. It has smalldisplacement rank bounded by a fixed constant. The class of such matrices generalizesToeplitz matrices. A good initial approximation to a short displacement generator forA/sup -1/ is readily available. Ways to refine this approximation and numerically compute a displacement generator of A/sup -1/ and the solution vector x=A/sup -1/b to a linear system Ax=b by using O(log/sup 2/n) parallel arithmetic steps and n processors arepresented. These results are extended to some other important classes of densestructure matrices.</p>
Index Termsparallel algorithm; iterative algorithm; Toeplitz-like linear systems; parallel arithmeticsteps; computational complexity; matrix algebra; parallel algorithms

V. Pan, "Concurrent Iterative Algorithm for Toeplitz-like Linear Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 592-600, 1993.
79 ms
(Ver 3.3 (11022016))