changeset 24553:6e81c8a5add7 stable

doc: Correct errors in Diagonal matrix chapter of manual (bug #52814). * diagperm.txi: Correct definition of multiplication when rows exceeds columns. Use parentheses to accurately show how to solve A*x = b using LU decomposition.
author Rik <rik@octave.org>
date Sun, 07 Jan 2018 21:40:02 -0800
parents ba8b828ee4f2
children cd42d0f341db a3a263a26aab
files doc/interpreter/diagperm.txi
diffstat 1 files changed, 3 insertions(+), 3 deletions(-) [+]
line wrap: on
line diff
--- a/doc/interpreter/diagperm.txi	Sun Jan 07 08:26:41 2018 -0800
+++ b/doc/interpreter/diagperm.txi	Sun Jan 07 21:40:02 2018 -0800
@@ -275,7 +275,7 @@
 then @code{D*M} is equivalent to
 
 @example
-[D(1:n,n) * M; zeros(m-n, columns (M))],
+[D(1:n,:) * M; zeros(m-n, columns (M))],
 @end example
 
 @noindent
@@ -447,7 +447,7 @@
 @example
 @group
   [L, U, P] = lu (A); ## now L*U = P*A
-  x = U \ L \ P*b;
+  x = U \ (L \ P) * b;
 @end group
 @end example
 
@@ -526,7 +526,7 @@
 
 The primary distinction is that an assumed zero, when multiplied
 by any number, or divided by any nonzero number,
-yields *always* a zero, even when, e.g., multiplied by @code{Inf}
+yields @strong{always} a zero, even when, e.g., multiplied by @code{Inf}
 or divided by @code{NaN}.
 The reason for this behavior is that the numerical multiplication is not
 actually performed anywhere by the underlying algorithm; the result is