Mercurial > octave-nkf
comparison src/DLD-FUNCTIONS/spparms.cc @ 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 | f3c00dc0912b |
children | eb63fbe60fab |
comparison
equal
deleted
inserted
replaced
8827:55d999c23728 | 8828:8463d1a2e544 |
---|---|
45 @deftypefnx {Loadable Function} { } spparms (@var{key}, @var{val})\n\ | 45 @deftypefnx {Loadable Function} { } spparms (@var{key}, @var{val})\n\ |
46 Sets or displays the parameters used by the sparse solvers and factorization\n\ | 46 Sets or displays the parameters used by the sparse solvers and factorization\n\ |
47 functions. The first four calls above get information about the current\n\ | 47 functions. The first four calls above get information about the current\n\ |
48 settings, while the others change the current settings. The parameters are\n\ | 48 settings, while the others change the current settings. The parameters are\n\ |
49 stored as pairs of keys and values, where the values are all floats and the\n\ | 49 stored as pairs of keys and values, where the values are all floats and the\n\ |
50 keys are one of the strings\n\ | 50 keys are one of the following strings:\n\ |
51 \n\ | 51 \n\ |
52 @itemize\n\ | 52 @table @code\n\ |
53 @item spumoni\n\ | 53 @item spumoni\n\ |
54 Printing level of debugging information of the solvers (default 0)\n\ | 54 Printing level of debugging information of the solvers (default 0)\n\ |
55 @item ths_rel\n\ | 55 @item ths_rel\n\ |
56 Included for compatibility. Not used. (default 1)\n\ | 56 Included for compatibility. Not used. (default 1)\n\ |
57 @item ths_abs\n\ | 57 @item ths_abs\n\ |
78 The density of non-zero elements in a banded matrix before it is treated\n\ | 78 The density of non-zero elements in a banded matrix before it is treated\n\ |
79 by the LAPACK banded solvers (default 0.5)\n\ | 79 by the LAPACK banded solvers (default 0.5)\n\ |
80 @item umfpack\n\ | 80 @item umfpack\n\ |
81 Flag whether the UMFPACK or mmd solvers are used for the LU, '\\' and\n\ | 81 Flag whether the UMFPACK or mmd solvers are used for the LU, '\\' and\n\ |
82 '/' operations (default 1)\n\ | 82 '/' operations (default 1)\n\ |
83 @end itemize\n\ | 83 @end table\n\ |
84 \n\ | 84 \n\ |
85 The value of individual keys can be set with @code{spparms (@var{key},\n\ | 85 The value of individual keys can be set with @code{spparms (@var{key},\n\ |
86 @var{val})}. The default values can be restored with the special keyword\n\ | 86 @var{val})}. The default values can be restored with the special keyword\n\ |
87 'defaults'. The special keyword 'tight' can be used to set the mmd solvers\n\ | 87 'defaults'. The special keyword 'tight' can be used to set the mmd solvers\n\ |
88 to attempt for a sparser solution at the potential cost of longer running\n\ | 88 to attempt for a sparser solution at the potential cost of longer running\n\ |