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

QSpace/Manakin Repository

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

Show full item record


Title: Accelerating The Convergence Of Cubic Interpolation Method Using Concurrent Algorithm Based On The Transputer Technology
Author: Al Mohannadi, A. L.
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.
URI: http://hdl.handle.net/10576/7842
Date: 1992

Files in this item

Files Size Format View
abstract.pdf 2.091Kb PDF View/Open
abstract.doc 20.5Kb Microsoft Word View/Open
06-92-5-0009-fulltext.pdf 184.4Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search QSpace


Advanced Search

Browse

My Account