By Topic

Fast parallel linear equation solvers based on textured decomposition

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

3 Author(s)
Huang, G. ; Texas A&M University, College Station, TX ; Tsai, W.K. ; Lu, W.

A fast linear equation solver based on recursive textured decompositions is introduced in this paper. The computational time complexity for solving problems of N unknown variables is in the order of one if N processors are available. It is faster than the multigrid method, so far known as the fastest available method for two dimensional Poisson equation, which has time complexity of O(log N). The basic difference between this approach, and classical iterative algorithms, is that different approximations of the system matrix are used in round-robin fashion while one fixed approximation is used in the classical approach. We show that, with proper choice of approximation compositions, the spectral radius of error dynamic is reduced drastically; and with proper decomposition size, the spectral radius will approach to a constant strictly less than one, even if the dimension of the problem tends to infinity. This enables us to devise a parallel algorithm with order one time complexity.

Published in:

Decision and Control, 1987. 26th IEEE Conference on  (Volume:26 )

Date of Conference:

9-11 Dec. 1987