This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Accelerated Relaxation Method for Linear Inequalities
February 1971 (vol. 20 no. 2)
pp. 222-225
An algorithm called the accelerated relaxation method for finding a solution of a set of inequalities is given. Experimental results show that the accelerated relaxation method is far more efficient than the relaxation method, the fixed increment method, and the generalized-inverse Ho-Kashyap algorithm.
Index Terms:
Acceleration scheme, convergence rate, fixed increment method, inequalities, iteration, pattern recognition, relaxation method, threshold switching theory.
Citation:
null Chin Liang Chang, "The Accelerated Relaxation Method for Linear Inequalities," IEEE Transactions on Computers, vol. 20, no. 2, pp. 222-225, Feb. 1971, doi:10.1109/T-C.1971.223218
Usage of this product signifies your acceptance of the Terms of Use.