Accelerating The Convergence Of Cubic Interpolation Method Using Concurrent Algorithm Based On The Transputer Technology

Show simple item record

contributor.author Al Mohannadi, A. L. en_US
date.accessioned 2009-11-25T13:03:34Z en_US
date.available 2009-11-25T13:03:34Z en_US
date.issued 1992 en_US
identifier.citation Engineering Journal of Qatar University, 1992, Vol. 5, Pages 135-143. en_US
identifier.uri http://hdl.handle.net/10576/7842 en_US
description.abstract This paper describes a concurrent method to speed up the convergence of the QIOM (Cubic Interpolation Optimization Method) to obtain the global minima for any nonlinear continuous function. The QIOM is a naturally slow, sequential procedure, but usually guarantees a global solution. The acceleration of convergence is investigated from two points of view. One concurrency can be seen in the region bounded by the lower and upper limits on the function variables. The other concurrency is seen in investigating the QIOM algorithm itself. Due to the fact that many accelerators involve parallel processors, most of the algorithms today used for optimization are written specifically for sequential processors. This algorithm is implemented using Occam and Transputer Technology. The algorithm is tested on one well known nonlinear function. en_US
language.iso en en_US
publisher Qatar University en_US
subject Engineering: Research Teaching en_US
title Accelerating The Convergence Of Cubic Interpolation Method Using Concurrent Algorithm Based On The Transputer Technology en_US
type Article en_US
identifier.pagination 135-143 en_US
identifier.volume 5 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record