2 HH f X fa XX AX=+〈〉+〈〉(1) where A is an nxn symmetric positive definite constant matrix
operator on Hilbert space H, a is a vector in H and 0 f is a constant term. The minimization of …

Some Computational algorithms are considered in this work. Specifically Conjugate
Gradient (CGM), Fletcher-Reeves, Steepest Descent and Fibonacci methods are considered …

We considered Computational results with Fibonacci scheme for Gradient method. In
Particular, Fibonacci scheme is used as against the arbitrary perturbation term, lambda (λ) in …

The Devine power of God has made me to reach the apex of the carrier given to me by Him. I
have passed through the shadow of death several times but the Almighty God still spare my …

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 …