GNU Octave Manual Version 3 A high-level interactive language for numerical computations Edition 3 for Octave version 3.0.2 August 2008 John W. Eaton David Bateman Søren Hauberg

GNU Octave Manual Version 3 Buy the book here >>> learn more

(1) The ‘#!’ mechanism works on Unix systems derived from Berkeley Unix, System V Release 4, and some System V Release 3 systems.

(2) See the additional document Dynamically Linked Functions in GNU Octave at http://www.network-theory.co.uk/octave/manual/

(3) 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 lsode should not be called either directly or indirectly from within the user-supplied function that lsode requires. Doing so will result in an error.

(4) 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 positive integer.

(5) See section 7.1 Global Variables, for information about how to access global variables inside a function.

(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

(9) G. Marsaglia and W.W. Tsang, Ziggurat method for generating random variables, J. Statistical Software, vol 5, 2000, http://www.jstatsoft.org/v05/i08/

(10) The old versions of rand and randn 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.

(12) Youcef Saad "SPARSKIT: A basic toolkit for sparse matrix computation", 1994.
http://www-users.cs.umn.edu/~saad/software/SPARSKIT/paper.ps

(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.

(15) See http://www.cise.ufl.edu/research/sparse for ccolamd, csymamd, amd, colamd, symamd, and other related orderings.

(16) See http://www.cise.ufl.edu/research/sparse/colamd.

(17) See http://www.cise.ufl.edu/research/sparse for ccolamd, csymamd, amd, colamd, symamd, and other related orderings.

(18) See http://www.cise.ufl.edu/research/sparse/colamd.

(19) The cholmod, umfpack and cxsparse packages were written by Tim Davis and are available at http://www.cise.ufl.edu/research/sparse/

(20) http://citeseer.ist.psu.edu/223007.html

(21) http://www.cise.ufl.edu/research/sparse/umfpack/

(22) http://www.inf.ethz.ch/personal/gander/

(23) Barber, C.B., Dobkin, D.P., and Huhdanpaa, H.T., "The Quickhull algorithm for convex hulls," ACM Trans. on Mathematical Software, 22(4):469-483, Dec 1996, http://www.qhull.org