comparison doc/interpreter/diagperm.txi @ 10791:3140cb7a05a1

Add spellchecker scripts for Octave and run spellcheck of documentation interpreter/doccheck: New directory for spelling/grammar scripts. interpreter/doccheck/README: Instructions for using scripts. interpreter/doccheck/spellcheck: Script to spellcheck a Texinfo file. interpreter/doccheck/aspell.conf: GNU Aspell configuration file for Octave documentation. interpreter/doccheck/aspell-octave.en.pws: Private Aspell dictionary. interpreter/doccheck/add_to_aspell_dict: Script to add new Octave-specific words to private Aspell dictionary. interpreter/octave.texi: New @nospell macro which forces Aspell to ignore the word marked by the macro. interpreter/mk_doc_cache.m: Skip new @nospell macro when building doc_cache.
author Rik <octave@nomad.inbox5.com>
date Sat, 17 Jul 2010 19:53:01 -0700
parents 923c7cb7f13f
children 322f43e0e170
comparison
equal deleted inserted replaced
10790:01f1643dfbb1 10791:3140cb7a05a1
37 @end tex 37 @end tex
38 @ifnottex 38 @ifnottex
39 @code{D(i,j) == 0} if @code{i != j}. 39 @code{D(i,j) == 0} if @code{i != j}.
40 @end ifnottex 40 @end ifnottex
41 Most often, square diagonal matrices are considered; however, the definition can equally 41 Most often, square diagonal matrices are considered; however, the definition can equally
42 be applied to nonsquare matrices, in which case we usually speak of a rectangular diagonal 42 be applied to non-square matrices, in which case we usually speak of a rectangular diagonal
43 matrix. 43 matrix.
44 44
45 A permutation matrix is defined as a square matrix that has a single element equal to unity 45 A permutation matrix is defined as a square matrix that has a single element equal to unity
46 in each row and each column; all other elements are zero. That is, there exists a 46 in each row and each column; all other elements are zero. That is, there exists a
47 permutation (vector) 47 permutation (vector)
241 i.e., null rows are appended to the result. 241 i.e., null rows are appended to the result.
242 The situation for right-multiplication @code{M*D} is analogous. 242 The situation for right-multiplication @code{M*D} is analogous.
243 243
244 The expressions @code{D \ M} and @code{M / D} perform inverse scaling. 244 The expressions @code{D \ M} and @code{M / D} perform inverse scaling.
245 They are equivalent to solving a diagonal (or rectangular diagonal) 245 They are equivalent to solving a diagonal (or rectangular diagonal)
246 in a least-squares minimum-norm sense. In exact arithmetics, this is 246 in a least-squares minimum-norm sense. In exact arithmetic, this is
247 equivalent to multiplying by a pseudoinverse. The pseudoinverse of 247 equivalent to multiplying by a pseudoinverse. The pseudoinverse of
248 a rectangular diagonal matrix is again a rectangular diagonal matrix 248 a rectangular diagonal matrix is again a rectangular diagonal matrix
249 with swapped dimensions, where each nonzero diagonal element is replaced 249 with swapped dimensions, where each nonzero diagonal element is replaced
250 by its reciprocal. 250 by its reciprocal.
251 The matrix division algorithms do, in fact, use division rather than 251 The matrix division algorithms do, in fact, use division rather than