comparison doc/interpreter/sparse.txi @ 8828:8463d1a2e544

Doc fixes. * 2]$$. => 2].$$ * @var{extrapval} => @var{extrapval}. * call helloworld.oct => called @file{helloworld.oct} * @itemize => @table @code * shows. => shows: * save => @code{save} * @ref{Breakpoints} => @pxref{Breakpoints} * add @noindent following example * which is computed => and compute it * clarify wording * remove comma * good => well * set => number * by writing => with the command * has the option of directly calling => can call * [-like-] {+of the right size,+} * solvers => routines * handle => test for * add introductory section * add following * {+the+} [0..bitmax] => [0,bitmax] * of the => with * number => value * add usual * Besides when doing comparisons, logical => Logical {+also+} * array comparison => array, comparisons * param => parameter * works very similar => is similar * strings, => strings * most simple => simplest * easier => more easily * like => as * called => called, * clarify wording * you should simply type => use * clarify wording * means => way * equally => also * [-way much-] {+way+} * add with mean value parameter given by the first argument, @var{l} * add Functions described as @dfn{mapping functions} apply the given operation to each element when given a matrix argument. * in this brief introduction => here * It is worth noticing => Note * add following * means => ways
author Brian Gough <bjg@network-theory.co.uk>
date Fri, 20 Feb 2009 11:17:01 -0500
parents 03b7f618ab3d
children 235d71d77221
comparison
equal deleted inserted replaced
8827:55d999c23728 8828:8463d1a2e544
297 297
298 @DOCSTRING(spconvert) 298 @DOCSTRING(spconvert)
299 299
300 The above problem of memory reallocation can be avoided in 300 The above problem of memory reallocation can be avoided in
301 oct-files. However, the construction of a sparse matrix from an oct-file 301 oct-files. However, the construction of a sparse matrix from an oct-file
302 is more complex than can be discussed in this brief introduction, and 302 is more complex than can be discussed here, and
303 you are referred to chapter @ref{Dynamically Linked Functions}, to have 303 you are referred to chapter @ref{Dynamically Linked Functions}, to have
304 a full description of the techniques involved. 304 a full description of the techniques involved.
305 305
306 @node Information 306 @node Information
307 @subsection Finding out Information about Sparse Matrices 307 @subsection Finding out Information about Sparse Matrices
624 then @dfn{symamd} or @dfn{csymamd} should be used. Otherwise 624 then @dfn{symamd} or @dfn{csymamd} should be used. Otherwise
625 @dfn{amd}, @dfn{colamd} or @dfn{ccolamd} should be used. For completeness 625 @dfn{amd}, @dfn{colamd} or @dfn{ccolamd} should be used. For completeness
626 the reordering functions @dfn{colperm} and @dfn{randperm} are 626 the reordering functions @dfn{colperm} and @dfn{randperm} are
627 also available. 627 also available.
628 628
629 @xref{fig:simplematrix}, for an example of the structure of a simple 629 @xref{fig:simplematrix} for an example of the structure of a simple
630 positive definite matrix. 630 positive definite matrix.
631 631
632 @float Figure,fig:simplematrix 632 @float Figure,fig:simplematrix
633 @image{spmatrix,8cm} 633 @image{spmatrix,8cm}
634 @caption{Structure of simple sparse matrix.} 634 @caption{Structure of simple sparse matrix.}