# HG changeset patch
# User Rik <rik@octave.org>
# Date 1449780606 28800
# Node ID 8f123945970e88d59ccb12991de6402e1cf3dff8
# Parent  c54ae1fb7e3b37bc6671a797d756800ff5361a01# Parent  c132fbc748da97ba3088e39a7b883aa42e53c2c5
maint: Periodic merge of stable to default.

diff -r c54ae1fb7e3b -r 8f123945970e libinterp/corefcn/hess.cc
--- a/libinterp/corefcn/hess.cc	Thu Dec 10 12:49:30 2015 -0800
+++ b/libinterp/corefcn/hess.cc	Thu Dec 10 12:50:06 2015 -0800
@@ -48,13 +48,13 @@
 A = PHP^T\n\
 $$\n\
 where $P$ is a square unitary matrix ($P^TP = I$), and $H$\n\
-is upper Hessenberg ($H_{i,j} = 0, \\forall i \\ge j+1$).\n\
+is upper Hessenberg ($H_{i,j} = 0, \\forall i > j+1$).\n\
 @end tex\n\
 @ifnottex\n\
 @code{@var{P} * @var{H} * @var{P}' = @var{A}} where @var{P} is a square\n\
 unitary matrix (@code{@var{P}' * @var{P} = I}, using complex-conjugate\n\
 transposition) and @var{H} is upper Hessenberg\n\
-(@code{@var{H}(i, j) = 0 forall i >= j+1)}.\n\
+(@code{@var{H}(i, j) = 0 forall i > j+1)}.\n\
 @end ifnottex\n\
 \n\
 The Hessenberg decomposition is usually used as the first step in an\n\