By Topic

Computation of large scale constrained matrix problems: the splitting equilibration algorithm

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)
Nagurney, A. ; Massachusetts Univ., Amherst, MA, USA ; Eydeland, A. ; Kim, D.-S.

The authors introduce a general parallelizable computational method called the splitting equilibration algorithm for solving the entire class of constrained matrix problems. The empirical performance of the algorithm is investigated on the largest quadratic constrained matrix problems reported to date using the IBM 3090-600E at the Cornell National Supercomputer Facility in a serial and in a parallel environment. The goals are to compare the relative efficiency of the splitting equilibration algorithm to both the earlier equilibration algorithm and the much-cited Bachem and Korte algorithm, (1978) and to investigate the speedups obtained with parallelization of the splitting equilibration algorithm

Published in:

Supercomputing '90., Proceedings of

Date of Conference:

12-16 Nov 1990