X-Git-Url: http://gitweb.michael.orlitzky.com/?p=octave.git;a=blobdiff_plain;f=optimization%2Fpreconditioned_conjugate_gradient_method.m;h=f3ff7e2fd56b36e99d6c478cb1a75a18f2bbe170;hp=e2f841aefea06ec92e8bb1e8dbe85eb5f2b65747;hb=7240c54725b82c037dfb6e43bedefbb1bf47a0bc;hpb=79deafc20bc4cb3704f7f2cfcf845ed09d31eee3

diff --git a/optimization/preconditioned_conjugate_gradient_method.m b/optimization/preconditioned_conjugate_gradient_method.m
index e2f841a..f3ff7e2 100644
--- a/optimization/preconditioned_conjugate_gradient_method.m
+++ b/optimization/preconditioned_conjugate_gradient_method.m
@@ -14,8 +14,7 @@ function [x, k] = preconditioned_conjugate_gradient_method(Q, ...
   %   min [phi(x) = (1/2)*<Qx,x> + <b,x>]
   %
   % using the preconditioned conjugate gradient method (14.56 in
-  % Guler). If ``M`` is the identity matrix, we use the slightly
-  % faster implementation in conjugate_gradient_method.m.
+  % Guler).
   %
   % INPUT:
   %