GNU Octave Manual Version 3
A high-level interactive language for numerical computations
Edition 3 for Octave version 3.0.2
August 2008John W. Eaton David Bateman Søren Hauberg
(1) The ‘#!’ mechanism works on Unix systems derived from Berkeley Unix, System V Release 4, and some System V Release 3 systems.
Some of Octave's functions are
implemented in terms of functions that cannot be called recursively.
For example, the ODE solver
lsode is ultimately implemented in a
Fortran subroutine that cannot be called recursively, so
should not be called either directly or indirectly from within the
user-supplied function that
lsode requires. Doing so will result
in an error.
It would be
much better to use
prod (1:n), or
gamma (n+1) instead,
after first checking to ensure that the value
n is actually a
(6) The ‘.m’ suffix was chosen for compatibility with Matlab.
(7) For example, to first sort based on the values in column 1, and then, for any values that are repeated in column 1, sort based on the values found in column 2, etc.
(8) See M. Matsumoto and T. Nishimura, Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator, ACM Trans. on Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 1998, http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
The old versions of
obtain their initial seeds from the system clock.
(11) Knowledge of the storage technique is also necessary for those wishing to create their own opt-files.
Youcef Saad "SPARSKIT: A basic toolkit for sparse matrix
(13) Pre-sorting the data will make the creation of the sparse matrix faster.
(14) The above problem of memory reallocation can be avoided in oct-files. However, the construction of a sparse matrix from an oct-file is more complex than can be discussed here.
(19) The cholmod, umfpack and cxsparse packages were written by Tim Davis and are available at http://www.cise.ufl.edu/research/sparse/
|ISBN 095461206X||GNU Octave Manual Version 3||See the print edition|