Search

It has been proved that the conventional conjugate gradient Method Algorithm (CGM) converges in at most n iterations in a well posed quadratic functional problems. This work used Fibonacci Scheme on Gradient Method (GM) to solve quadratic functional problems and the results are favorable and comparable with CGM algorithm. [ABSTRACT FROM AUTHOR]

We considered Computational results with Fibonacci scheme for Gradient method. In Particular, Fibonacci scheme is used as against the arbitrary perturbation term, lambda (λ) in Gradient method. It is proved that Fibonacci technique converges to the solution if the interval of uncertainty is known and N is large for the Fibonacci sequence in Gradient Method. [ABSTRACT FROM AUTHOR]

The Conjugate Gradient Method (CGM) algorithm is used to solve queue problems. The system parameters of queue theory are used to form the entries of the control matrix operator A associated with the CGM algorithm. The resulting control problem is solved and some comparative results are generated. [ABSTRACT FROM AUTHOR]