zk = M \ rk;
dk = -zk;
- while (k <= max_iterations)
-
- if (norm(rk) < tolerance)
- % Check our stopping condition. This should catch the k=0 case.
- x = xk;
- return;
- end
-
+ while (k <= max_iterations && norm(rk, 'inf') > tolerance)
% Used twice, avoid recomputation.
rkzk = rk' * zk;
% do them both, so we precompute the more expensive operation.
Qdk = Q * dk;
- alpha_k = rkzk/(dk' * Qdk);
+ % We're going to divide by this quantity...
+ dkQdk = dk' * Qdk;
+
+ % So if it's too close to zero, we replace it with something
+ % comparable but non-zero.
+ if (abs(dkQdk) < eps)
+ dkQdk = sign(dkQdk)*eps;
+ end
+
+ alpha_k = rkzk/dkQdk;
x_next = xk + (alpha_k * dk);
% The recursive definition of r_next is prone to accumulate
% roundoff error. When sqrt(n) divides k, we recompute the
- % residual to minimize this error. This modification is due to the
- % second reference.
+ % residual to minimize this error. This modification was suggested
+ % by the second reference.
if (mod(k, sqrt_n) == 0)
r_next = Q*x_next - b;
else
dk = d_next;
end
- % The algorithm didn't converge, but we still want to return the
- % terminal value of xk.
+ % If we make it here, one of the two stopping conditions was met.
x = xk;
end