Mercurial > octave-nkf
changeset 8517:81d6ab3ac93c
Allow documentation tobe built for other formats than tex and info
line wrap: on
line diff
--- a/scripts/ChangeLog Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/ChangeLog Wed Jan 14 20:44:25 2009 -0500 @@ -1,5 +1,26 @@ +2009-01-14 Søren Hauberg <hauberg@gmail.com> + + * general/diff.m, general/logspace.m, general/nextpow2.m, + linear-algebra/commutation_matrix.m, + linear-algebra/duplication_matrix.m, linear-algebra/expm.m, + miscellaneous/bincoeff.m, miscellaneous/list_primes.m, + optimization/fsolve.m, plot/subplot.m, polynomial/pchip.m, + polynomial/polyout.m, polynomial/residue.m, polynomial/spline.m, + signal/freqz.m, signal/sinc.m, specfun/beta.m, specfun/betaln.m, + specfun/nchoosek.m, specfun/pow2.m, special-matrix/hankel.m, + special-matrix/hilb.m, special-matrix/invhilb.m + special-matrix/sylvester_matrix.m, special-matrix/toeplitz.m, + special-matrix/vander.m, statistics/base/gls.m, + statistics/base/kendall.m, statistics/base/kurtosis.m, + statistics/base/mean.m, statistics/base/median.m, + statistics/base/ols.m, statistics/base/skewness.m, + statistics/distributions/kolmogorov_smirnov_cdf.m: + Use ifnottex instead of ifinfo. + 2009-01-14 John W. Eaton <jwe@octave.org> + * linear-algebra/expm.m: + * optimization/fsolve.m: Doc fix. * plot/__go_draw_axes__.m: Scale markersize by 1/3, not 1/6.
--- a/scripts/general/diff.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/general/diff.m Wed Jan 14 20:44:25 2009 -0500 @@ -26,9 +26,9 @@ ## $x_2 - x_1, \ldots{}, x_n - x_{n-1}$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @var{x}(2) - @var{x}(1), @dots{}, @var{x}(n) - @var{x}(n-1). -## @end ifinfo +## @end ifnottex ## ## If @var{x} is a matrix, @code{diff (@var{x})} is the matrix of column ## differences along the first non-singleton dimension.
--- a/scripts/general/logspace.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/general/logspace.m Wed Jan 14 20:44:25 2009 -0500 @@ -26,9 +26,9 @@ ## $10^{base}$ to $10^{limit}$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## 10^base to 10^limit. -## @end ifinfo +## @end ifnottex ## ## If @var{limit} is equal to ## @iftex @@ -36,27 +36,27 @@ ## $\pi$, ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## pi, -## @end ifinfo +## @end ifnottex ## the points are between ## @iftex ## @tex ## $10^{base}$ and $\pi$, ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## 10^base and pi, -## @end ifinfo +## @end ifnottex ## @emph{not} ## @iftex ## @tex ## $10^{base}$ and $10^{\pi}$, ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## 10^base and 10^pi, -## @end ifinfo +## @end ifnottex ## in order to be compatible with the corresponding @sc{Matlab} ## function. ##
--- a/scripts/general/nextpow2.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/general/nextpow2.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,9 +25,9 @@ ## $2^n \ge |x|$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## 2^n >= abs (x). -## @end ifinfo +## @end ifnottex ## ## If @var{x} is a vector, return @code{nextpow2 (length (@var{x}))}. ## @seealso{pow2}
--- a/scripts/linear-algebra/commutation_matrix.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/linear-algebra/commutation_matrix.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,45 +25,45 @@ ## $K_{m,n}$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## K(m,n) -## @end ifinfo +## @end ifnottex ## which is the unique ## @iftex ## @tex ## $m n \times m n$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @var{m}*@var{n} by @var{m}*@var{n} -## @end ifinfo +## @end ifnottex ## matrix such that ## @iftex ## @tex ## $K_{m,n} \cdot {\rm vec} (A) = {\rm vec} (A^T)$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{K(m,n) * vec(A) = vec(A')} -## @end ifinfo +## @end ifnottex ## for all ## @iftex ## @tex ## $m\times n$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{m} by @math{n} -## @end ifinfo +## @end ifnottex ## matrices ## @iftex ## @tex ## $A$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{A}. -## @end ifinfo +## @end ifnottex ## ## If only one argument @var{m} is given, ## @iftex @@ -71,9 +71,9 @@ ## $K_{m,m}$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{K(m,m)} -## @end ifinfo +## @end ifnottex ## is returned. ## ## See Magnus and Neudecker (1988), Matrix differential calculus with
--- a/scripts/linear-algebra/duplication_matrix.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/linear-algebra/duplication_matrix.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,45 +25,45 @@ ## $D_n$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{Dn} -## @end ifinfo +## @end ifnottex ## which is the unique ## @iftex ## @tex ## $n^2 \times n(n+1)/2$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{n^2} by @math{n*(n+1)/2} -## @end ifinfo +## @end ifnottex ## matrix such that ## @iftex ## @tex ## $D_n * {\rm vech} (A) = {\rm vec} (A)$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{Dn vech (A) = vec (A)} -## @end ifinfo +## @end ifnottex ## for all symmetric ## @iftex ## @tex ## $n \times n$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{n} by @math{n} -## @end ifinfo +## @end ifnottex ## matrices ## @iftex ## @tex ## $A$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{A}. -## @end ifinfo +## @end ifnottex ## ## See Magnus and Neudecker (1988), Matrix differential calculus with ## applications in statistics and econometrics.
--- a/scripts/linear-algebra/expm.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/linear-algebra/expm.m Wed Jan 14 20:44:25 2009 -0500 @@ -27,13 +27,13 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## expm(a) = I + a + a^2/2! + a^3/3! + ... ## @end example ## -## @end ifinfo +## @end ifnottex ## The Taylor series is @emph{not} the way to compute the matrix ## exponential; see Moler and Van Loan, @cite{Nineteen Dubious Ways to ## Compute the Exponential of a Matrix}, SIAM Review, 1978. This routine @@ -43,9 +43,9 @@ ## Pad\'e ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## Pade' -## @end ifinfo +## @end ifnottex ## approximation method with three step preconditioning (SIAM Journal on ## Numerical Analysis, 1977). Diagonal ## @iftex @@ -53,32 +53,32 @@ ## Pad\'e ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## Pade' -## @end ifinfo +## @end ifnottex ## approximations are rational polynomials of matrices ## @iftex ## @tex ## $D_q(a)^{-1}N_q(a)$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## -1 ## D (a) N (a) ## @end example ## -## @end ifinfo +## @end ifnottex ## whose Taylor series matches the first ## @iftex ## @tex ## $2 q + 1 $ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @code{2q+1} -## @end ifinfo +## @end ifnottex ## terms of the Taylor series above; direct evaluation of the Taylor series ## (with the same preconditioning steps) may be desirable in lieu of the ## @iftex @@ -86,18 +86,18 @@ ## Pad\'e ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## Pade' -## @end ifinfo +## @end ifnottex ## approximation when ## @iftex ## @tex ## $D_q(a)$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @code{Dq(a)} -## @end ifinfo +## @end ifnottex ## is ill-conditioned. ## @end deftypefn
--- a/scripts/miscellaneous/bincoeff.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/miscellaneous/bincoeff.m Wed Jan 14 20:44:25 2009 -0500 @@ -27,7 +27,7 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## @group @@ -38,7 +38,7 @@ ## \ / ## @end group ## @end example -## @end ifinfo +## @end ifnottex ## ## For example, ##
--- a/scripts/miscellaneous/list_primes.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/miscellaneous/list_primes.m Wed Jan 14 20:44:25 2009 -0500 @@ -28,9 +28,9 @@ ## {\TeX}book. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## TeXbook. -## @end ifinfo +## @end ifnottex ## @end deftypefn ## Author: jwe
--- a/scripts/plot/subplot.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/plot/subplot.m Wed Jan 14 20:44:25 2009 -0500 @@ -43,7 +43,7 @@ ## \vskip 10pt ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @display ## @example ## @group @@ -56,7 +56,7 @@ ## @end group ## @end example ## @end display -## @end ifinfo +## @end ifnottex ## @seealso{plot} ## @end deftypefn
--- a/scripts/polynomial/pchip.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/polynomial/pchip.m Wed Jan 14 20:44:25 2009 -0500 @@ -35,9 +35,9 @@ ## $$[s_1, s_2, \cdots, s_k, n]$$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @code{[@var{s1}, @var{s2}, @dots{}, @var{sk}, @var{n}]} -## @end ifinfo +## @end ifnottex ## The array is then reshaped internally to a matrix where the leading ## dimension is given by ## @iftex @@ -45,9 +45,9 @@ ## $$s_1 s_2 \cdots s_k$$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @code{@var{s1} * @var{s2} * @dots{} * @var{sk}} -## @end ifinfo +## @end ifnottex ## and each row in this matrix is then treated separately. Note that this ## is exactly the opposite treatment than @code{interp1} and is done ## for compatibility.
--- a/scripts/polynomial/polyout.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/polynomial/polyout.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,11 +25,11 @@ ## $$ c(x) = c_1 x^n + \ldots + c_n x + c_{n+1} $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @example ## c(x) = c(1) * x^n + ... + c(n) x + c(n+1) ## @end example -## @end ifinfo +## @end ifnottex ## and return it as a string or write it to the screen (if ## @var{nargout} is zero). ## @var{x} defaults to the string @code{"s"}.
--- a/scripts/polynomial/residue.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/polynomial/residue.m Wed Jan 14 20:44:25 2009 -0500 @@ -31,14 +31,14 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## B(s) M r(m) N ## ---- = SUM ------------- + SUM k(i)*s^(N-i) ## A(s) m=1 (s-p(m))^e(m) i=1 ## @end example -## @end ifinfo +## @end ifnottex ## ## @noindent ## where @math{M} is the number of poles (the length of the @var{r}, @@ -69,7 +69,7 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## s^2 + s + 1 -2 7 3 @@ -77,7 +77,7 @@ ## s^3 - 5s^2 + 8s - 4 (s-2) (s-2)^2 (s-1) ## @end example ## -## @end ifinfo +## @end ifnottex ## ## @deftypefnx {Function File} {[@var{b}, @var{a}] =} residue (@var{r}, @var{p}, @var{k}) ## @deftypefnx {Function File} {[@var{b}, @var{a}] =} residue (@var{r}, @var{p}, @var{k}, @var{e}) @@ -128,14 +128,14 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## -2 7 3 s^4 - 5s^3 + 9s^2 - 3s + 1 ## ----- + ------- + ----- + s = -------------------------- ## (s-2) (s-2)^2 (s-1) s^3 - 5s^2 + 8s - 4 ## @end example -## @end ifinfo +## @end ifnottex ## @seealso{poly, roots, conv, deconv, mpoles, polyval, polyderiv, polyinteg} ## @end deftypefn
--- a/scripts/polynomial/spline.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/polynomial/spline.m Wed Jan 14 20:44:25 2009 -0500 @@ -40,18 +40,18 @@ ## $$[s_1, s_2, \cdots, s_k, n]$$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @code{[@var{s1}, @var{s2}, @dots{}, @var{sk}, @var{n}]} -## @end ifinfo +## @end ifnottex ## or ## @iftex ## @tex ## $$[s_1, s_2, \cdots, s_k, n + 2]$$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @code{[@var{s1}, @var{s2}, @dots{}, @var{sk}, @var{n} + 2]}. -## @end ifinfo +## @end ifnottex ## The array is then reshaped internally to a matrix where to leading ## dimension is given by ## @iftex @@ -59,9 +59,9 @@ ## $$s_1 s_2 \cdots s_k$$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @code{@var{s1} * @var{s2} * @dots{} * @var{sk}} -## @end ifinfo +## @end ifnottex ## and each row this matrix is then treated separately. Note that this ## is exactly the opposite treatment than @code{interp1} and is done ## for compatibility.
--- a/scripts/signal/freqz.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/signal/freqz.m Wed Jan 14 20:44:25 2009 -0500 @@ -23,9 +23,9 @@ ## whose numerator and denominator coefficients are @var{b} and @var{a}, ## respectively. The response is evaluated at @var{n} angular frequencies ## between 0 and -## @ifinfo +## @ifnottex ## 2*pi. -## @end ifinfo +## @end ifnottex ## @iftex ## @tex ## $2\pi$. @@ -37,9 +37,9 @@ ## ## If the fourth argument is omitted, the response is evaluated at ## frequencies between 0 and -## @ifinfo +## @ifnottex ## pi. -## @end ifinfo +## @end ifnottex ## @iftex ## @tex ## $\pi$.
--- a/scripts/signal/sinc.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/signal/sinc.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,9 +25,9 @@ ## $ \sin (\pi x)/(\pi x)$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## sin(pi*x)/(pi*x). -## @end ifinfo +## @end ifnottex ## @end deftypefn ## Author: jwe ???
--- a/scripts/specfun/beta.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/specfun/beta.m Wed Jan 14 20:44:25 2009 -0500 @@ -27,12 +27,12 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## beta (a, b) = gamma (a) * gamma (b) / gamma (a + b). ## @end example -## @end ifinfo +## @end ifnottex ## @end deftypefn ## Author: KH <Kurt.Hornik@wu-wien.ac.at>
--- a/scripts/specfun/betaln.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/specfun/betaln.m Wed Jan 14 20:44:25 2009 -0500 @@ -26,12 +26,12 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## betaln (a, b) = gammaln (a) + gammaln (b) - gammaln (a + b) ## @end example -## @end ifinfo +## @end ifnottex ## @seealso{beta, betainc, gammaln} ## @end deftypefn
--- a/scripts/specfun/nchoosek.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/specfun/nchoosek.m Wed Jan 14 20:44:25 2009 -0500 @@ -32,7 +32,7 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## @group @@ -43,7 +43,7 @@ ## \ / ## @end group ## @end example -## @end ifinfo +## @end ifnottex ## ## If @var{n} is a vector generate all combinations of the elements ## of @var{n}, taken @var{k} at a time, one row per combination. The
--- a/scripts/specfun/pow2.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/specfun/pow2.m Wed Jan 14 20:44:25 2009 -0500 @@ -26,18 +26,18 @@ ## $2^x$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## 2 .^ x -## @end ifinfo +## @end ifnottex ## for each element of @var{x}. With two arguments, returns ## @iftex ## @tex ## $f \cdot 2^e$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## f .* (2 .^ e). -## @end ifinfo +## @end ifnottex ## @seealso{nextpow2} ## @end deftypefn
--- a/scripts/special-matrix/hankel.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/special-matrix/hankel.m Wed Jan 14 20:44:25 2009 -0500 @@ -34,7 +34,7 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## @group @@ -42,7 +42,7 @@ ## H(i,j) = r(i+j-m), otherwise ## @end group ## @end example -## @end ifinfo +## @end ifnottex ## @seealso{vander, sylvester_matrix, hilb, invhilb, toeplitz} ## @end deftypefn
--- a/scripts/special-matrix/hilb.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/special-matrix/hilb.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,9 +25,9 @@ ## $i,\,j$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## i, j -## @end ifinfo +## @end ifnottex ## element of a Hilbert matrix is defined as ## @iftex ## @tex @@ -36,12 +36,12 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## H (i, j) = 1 / (i + j - 1) ## @end example -## @end ifinfo +## @end ifnottex ## @seealso{hankel, vander, sylvester_matrix, invhilb, toeplitz} ## @end deftypefn
--- a/scripts/special-matrix/invhilb.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/special-matrix/invhilb.m Wed Jan 14 20:44:25 2009 -0500 @@ -35,7 +35,7 @@ ## \left( \matrix{ n \cr k } \right) ##$$ ## @end tex -## @ifinfo +## @ifnottex ## @example ## ## (i+j) /n+i-1\ /n+j-1\ /i+j-2\ 2 @@ -51,7 +51,7 @@ ## p(k) = -1 ( ) ( ) ## \ k-1 / \k/ ## @end example -## @end ifinfo +## @end ifnottex ## ## The validity of this formula can easily be checked by expanding ## the binomial coefficients in both formulas as factorials. It can
--- a/scripts/special-matrix/sylvester_matrix.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/special-matrix/sylvester_matrix.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,9 +25,9 @@ ## $n = 2^k$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## n = 2^k. -## @end ifinfo +## @end ifnottex ## @seealso{hankel, vander, hilb, invhilb, toeplitz} ## @end deftypefn
--- a/scripts/special-matrix/toeplitz.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/special-matrix/toeplitz.m Wed Jan 14 20:44:25 2009 -0500 @@ -37,7 +37,7 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## @group @@ -50,7 +50,7 @@ ## c(n) c(n-1) c(n-2) ... c(0) ## @end group ## @end example -## @end ifinfo +## @end ifnottex ## @seealso{hankel, vander, sylvester_matrix, hilb, invhilb} ## @end deftypefn
--- a/scripts/special-matrix/vander.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/special-matrix/vander.m Wed Jan 14 20:44:25 2009 -0500 @@ -32,7 +32,7 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## @group @@ -44,7 +44,7 @@ ## c(n)^(n-1) ... c(n)^2 c(n) 1 ## @end group ## @end example -## @end ifinfo +## @end ifnottex ## @seealso{hankel, sylvester_matrix, hilb, invhilb, toeplitz} ## @end deftypefn
--- a/scripts/statistics/base/gls.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/base/gls.m Wed Jan 14 20:44:25 2009 -0500 @@ -26,10 +26,10 @@ ## with $\bar{e} = 0$ and cov(vec($e$)) = $(s^2)o$, ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{y = x b + e} with @math{mean (e) = 0} and ## @math{cov (vec (e)) = (s^2) o}, -## @end ifinfo +## @end ifnottex ## where ## @iftex ## @tex @@ -38,12 +38,12 @@ ## tp$ matrix. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{y} is a @math{t} by @math{p} matrix, @math{x} is a @math{t} by ## @math{k} matrix, @math{b} is a @math{k} by @math{p} matrix, @math{e} ## is a @math{t} by @math{p} matrix, and @math{o} is a @math{t p} by ## @math{t p} matrix. -## @end ifinfo +## @end ifnottex ## ## @noindent ## Each row of @var{y} and @var{x} is an observation and each column a
--- a/scripts/statistics/base/kendall.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/base/kendall.m Wed Jan 14 20:44:25 2009 -0500 @@ -38,13 +38,13 @@ ## $$ \tau = {1 \over n(n-1)} \sum_{i,j} {\rm sign}(q_i-q_j) {\rm sign}(r_i-r_j) $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @example ## 1 ## tau = ------- SUM sign (q(i) - q(j)) * sign (r(i) - r(j)) ## n (n-1) i,j ## @end example -## @end ifinfo +## @end ifnottex ## ## @noindent ## in which the @@ -53,9 +53,9 @@ ## $q_i$ and $r_i$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @var{q}(@var{i}) and @var{r}(@var{i}) -## @end ifinfo +## @end ifnottex ## are the ranks of ## @var{x} and @var{y}, respectively. ##
--- a/scripts/statistics/base/kurtosis.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/base/kurtosis.m Wed Jan 14 20:44:25 2009 -0500 @@ -28,12 +28,12 @@ ## where $\bar{x}$ is the mean value of $x$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## kurtosis (x) = N^(-1) std(x)^(-4) sum ((x - mean(x)).^4) - 3 ## @end example -## @end ifinfo +## @end ifnottex ## ## @noindent ## of @var{x}. If @var{x} is a matrix, return the kurtosis over the
--- a/scripts/statistics/base/mean.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/base/mean.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,12 +25,12 @@ ## $$ {\rm mean}(x) = \bar{x} = {1\over N} \sum_{i=1}^N x_i $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## mean (x) = SUM_i x(i) / N ## @end example -## @end ifinfo +## @end ifnottex ## If @var{x} is a matrix, compute the mean for each column and return them ## in a row vector. ##
--- a/scripts/statistics/base/median.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/base/median.m Wed Jan 14 20:44:25 2009 -0500 @@ -31,7 +31,7 @@ ## $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## @group @@ -40,7 +40,7 @@ ## (x(N/2) + x((N/2)+1))/2, N even ## @end group ## @end example -## @end ifinfo +## @end ifnottex ## If @var{x} is a matrix, compute the median value for each ## column and return them in a row vector. If the optional @var{dim} ## argument is given, operate along this dimension.
--- a/scripts/statistics/base/ols.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/base/ols.m Wed Jan 14 20:44:25 2009 -0500 @@ -27,10 +27,10 @@ ## $\bar{e} = 0$, and cov(vec($e$)) = kron ($s, I$) ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{y = x b + e} with ## @math{mean (e) = 0} and @math{cov (vec (e)) = kron (s, I)}. -## @end ifinfo +## @end ifnottex ## where ## @iftex ## @tex @@ -38,11 +38,11 @@ ## $b$ is a $k \times p$ matrix, and $e$ is a $t \times p$ matrix. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @math{y} is a @math{t} by @math{p} matrix, @math{x} is a @math{t} by ## @math{k} matrix, @math{b} is a @math{k} by @math{p} matrix, and ## @math{e} is a @math{t} by @math{p} matrix. -## @end ifinfo +## @end ifnottex ## ## Each row of @var{y} and @var{x} is an observation and each column a ## variable.
--- a/scripts/statistics/base/skewness.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/base/skewness.m Wed Jan 14 20:44:25 2009 -0500 @@ -28,12 +28,12 @@ ## where $\bar{x}$ is the mean value of $x$. ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## ## @example ## skewness (x) = N^(-1) std(x)^(-3) sum ((x - mean(x)).^3) ## @end example -## @end ifinfo +## @end ifnottex ## ## @noindent ## of @var{x}. If @var{x} is a matrix, return the skewness along the
--- a/scripts/statistics/distributions/kolmogorov_smirnov_cdf.m Wed Jan 14 16:49:45 2009 -0500 +++ b/scripts/statistics/distributions/kolmogorov_smirnov_cdf.m Wed Jan 14 20:44:25 2009 -0500 @@ -25,13 +25,13 @@ ## $$ Q(x) = \sum_{k=-\infty}^\infty (-1)^k \exp(-2 k^2 x^2) $$ ## @end tex ## @end iftex -## @ifinfo +## @ifnottex ## @example ## Inf ## Q(x) = SUM (-1)^k exp(-2 k^2 x^2) ## k = -Inf ## @end example -## @end ifinfo +## @end ifnottex ## ## @noindent ## for @var{x} > 0.
--- a/src/ChangeLog Wed Jan 14 16:49:45 2009 -0500 +++ b/src/ChangeLog Wed Jan 14 20:44:25 2009 -0500 @@ -1,3 +1,15 @@ +2009-01-14 Søren Hauberg <hauberg@gmail.com> + + * DLD-FUNCTIONS/betainc.cc, DLD-FUNCTIONS/chol.cc, + DLD-FUNCTIONS/daspk.cc, DLD-FUNCTIONS/dasrt.cc, + DLD-FUNCTIONS/dassl.cc, DLD-FUNCTIONS/filter.cc, + DLD-FUNCTIONS/gammainc.cc, DLD-FUNCTIONS/gcd.cc, + DLD-FUNCTIONS/givens.cc, DLD-FUNCTIONS/hess.cc, + DLD-FUNCTIONS/lsode.cc, DLD-FUNCTIONS/qr.cc, DLD-FUNCTIONS/qz.cc, + DLD-FUNCTIONS/schur.cc, DLD-FUNCTIONS/svd.cc, + DLD-FUNCTIONS/syl.cc, data.cc, mappers.cc: + Use ifnottex instead of ifinfo. + 2009-01-14 John W. Eaton <jwe@octave.org> * load-path.cc (load_path::do_set): Call do_clear after disabling
--- a/src/DLD-FUNCTIONS/betainc.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/betainc.cc Wed Jan 14 20:44:25 2009 -0500 @@ -43,7 +43,7 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @smallexample\n\ x\n\ @@ -52,7 +52,7 @@ /\n\ t=0\n\ @end smallexample\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ If x has more than one component, both @var{a} and @var{b} must be\n\ scalars. If @var{x} is a scalar, @var{a} and @var{b} must be of\n\
--- a/src/DLD-FUNCTIONS/chol.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/chol.cc Wed Jan 14 20:44:25 2009 -0500 @@ -61,12 +61,12 @@ $ R^T R = A $.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ @var{r}' * @var{r} = @var{a}.\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ Called with one output argument @code{chol} fails if @var{a} or @var{s} is\n\ not positive definite. With two or more output arguments @var{p} flags\n\ @@ -82,12 +82,12 @@ $ R^T R = Q^T A Q$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ @var{r}' * @var{r} = @var{q}' * @var{a} * @var{q}.\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ The sparsity preserving permutation is generally returned as a matrix.\n\ However, given the flag 'vector', @var{q} will be returned as a vector\n\ @@ -97,12 +97,12 @@ $ R^T R = A (Q, Q)$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ @var{r}' * @var{r} = a (@var{q}, @var{q}).\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ Called with either a sparse or full matrix and uing the 'lower' flag,\n\ @code{chol} returns the lower triangular factorization such that\n\ @@ -111,12 +111,12 @@ $ L L^T = A $.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ @var{l} * @var{l}' = @var{a}.\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ In general the lower trinagular factorization is significantly faster for\n\ sparse matrices.\n\
--- a/src/DLD-FUNCTIONS/daspk.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/daspk.cc Wed Jan 14 20:44:25 2009 -0500 @@ -185,7 +185,7 @@ with\n\ $$ x(t_0) = x_0, \\dot{x}(t_0) = \\dot{x}_0 $$\n\ @end tex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ 0 = f (x, xdot, t)\n\ @@ -197,7 +197,7 @@ x(t_0) = x_0, xdot(t_0) = xdot_0\n\ @end example\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ The solution is returned in the matrices @var{x} and @var{xdot},\n\ with each row in the result matrices corresponding to one of the\n\ elements in the vector @var{t}. The first element of @var{t}\n\ @@ -228,14 +228,14 @@ + c {\\partial f \\over \\partial \\dot{x}}\n\ $$\n\ @end tex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ df df\n\ jac = -- + c ------\n\ dx d xdot\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ The modified Jacobian function must have the form\n\ \n\
--- a/src/DLD-FUNCTIONS/dasrt.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/dasrt.cc Wed Jan 14 20:44:25 2009 -0500 @@ -220,7 +220,7 @@ with\n\ $$ x(t_0) = x_0, \\dot{x}(t_0) = \\dot{x}_0 $$\n\ @end tex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ 0 = f (x, xdot, t)\n\ @@ -232,7 +232,7 @@ x(t_0) = x_0, xdot(t_0) = xdot_0\n\ @end example\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ with functional stopping criteria (root solving).\n\ \n\ The solution is returned in the matrices @var{x} and @var{xdot},\n\ @@ -271,7 +271,7 @@ + c {\\partial f \\over \\partial \\dot{x}}\n\ $$\n\ @end tex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ df df\n\ @@ -279,7 +279,7 @@ dx d xdot\n\ @end example\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ The modified Jacobian function must have the form\n\ \n\
--- a/src/DLD-FUNCTIONS/dassl.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/dassl.cc Wed Jan 14 20:44:25 2009 -0500 @@ -187,7 +187,7 @@ $$ x(t_0) = x_0, \\dot{x}(t_0) = \\dot{x}_0 $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ 0 = f (x, xdot, t)\n\ @@ -200,7 +200,7 @@ x(t_0) = x_0, xdot(t_0) = xdot_0\n\ @end example\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ The solution is returned in the matrices @var{x} and @var{xdot},\n\ with each row in the result matrices corresponding to one of the\n\ elements in the vector @var{t}. The first element of @var{t}\n\ @@ -234,13 +234,13 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @example\n\ df df\n\ jac = -- + c ------\n\ dx d xdot\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ The modified Jacobian function must have the form\n\ \n\
--- a/src/DLD-FUNCTIONS/filter.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/filter.cc Wed Jan 14 20:44:25 2009 -0500 @@ -294,20 +294,20 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @smallexample\n\ N M\n\ SUM a(k+1) y(n-k) = SUM b(k+1) x(n-k) for 1<=n<=length(x)\n\ k=0 k=0\n\ @end smallexample\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ @noindent\n\ where\n\ -@ifinfo\n\ +@ifnottex\n\ N=length(a)-1 and M=length(b)-1.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @iftex\n\ @tex\n\ $a \\in \\Re^{N-1}$, $b \\in \\Re^{M-1}$, and $x \\in \\Re^P$.\n\ @@ -323,20 +323,20 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @smallexample\n\ N M\n\ y(n) = - SUM c(k+1) y(n-k) + SUM d(k+1) x(n-k) for 1<=n<=length(x)\n\ k=1 k=0\n\ @end smallexample\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ @noindent\n\ where\n\ -@ifinfo\n\ +@ifnottex\n\ c = a/a(1) and d = b/a(1).\n\ -@end ifinfo\n\ +@end ifnottex\n\ @iftex\n\ @tex\n\ $c = a/a_1$ and $d = b/a_1$.\n\ @@ -361,7 +361,7 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ M\n\ @@ -372,7 +372,7 @@ 1 + SUM c(k+1) z^(-k)\n\ k=1\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ @end deftypefn") { octave_value_list retval;
--- a/src/DLD-FUNCTIONS/gammainc.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/gammainc.cc Wed Jan 14 20:44:25 2009 -0500 @@ -43,7 +43,7 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @smallexample\n\ x\n\ @@ -53,7 +53,7 @@ t=0\n\ @end smallexample\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ with the limiting value of 1 as @var{x} approaches infinity.\n\ The standard notation is @math{P(a,x)}, e.g. Abramowitz and Stegun (6.5.1).\n\ \n\
--- a/src/DLD-FUNCTIONS/gcd.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/gcd.cc Wed Jan 14 20:44:25 2009 -0500 @@ -80,11 +80,11 @@ Optional return arguments @var{v1}, etc, contain integer vectors such\n\ that,\n\ \n\ -@ifinfo\n\ +@ifnottex\n\ @example\n\ @var{g} = @var{v1} .* @var{a1} + @var{v2} .* @var{a2} + @dots{}\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ @iftex\n\ @tex\n\ $g = v_1 a_1 + v_2 a_2 + \\cdots$\n\
--- a/src/DLD-FUNCTIONS/givens.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/givens.cc Wed Jan 14 20:44:25 2009 -0500 @@ -47,11 +47,11 @@ with $x$ and $y$ scalars.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ Return a 2 by 2 orthogonal matrix\n\ @code{@var{g} = [@var{c} @var{s}; -@var{s}' @var{c}]} such that\n\ @code{@var{g} [@var{x}; @var{y}] = [*; 0]} with @var{x} and @var{y} scalars.\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ For example,\n\ \n\
--- a/src/DLD-FUNCTIONS/hess.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/hess.cc Wed Jan 14 20:44:25 2009 -0500 @@ -56,11 +56,11 @@ is upper Hessenberg ($H_{i,j} = 0, \\forall i \\ge j+1$).\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{p * h * p' = a} where @code{p} is a square unitary matrix\n\ (@code{p' * p = I}, using complex-conjugate transposition) and @code{h}\n\ is upper Hessenberg (@code{i >= j+1 => h (i, j) = 0}).\n\ -@end ifinfo\n\ +@end ifnottex\n\ @end deftypefn") { octave_value_list retval;
--- a/src/DLD-FUNCTIONS/lsode.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/lsode.cc Wed Jan 14 20:44:25 2009 -0500 @@ -171,7 +171,7 @@ with\n\ $$ x(t_0) = x_0 $$\n\ @end tex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ dx\n\ @@ -185,7 +185,7 @@ x(t_0) = x_0\n\ @end example\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ The solution is returned in the matrix @var{x}, with each row\n\ corresponding to an element of the vector @var{t}. The first element\n\ of @var{t} should be @math{t_0} and should correspond to the initial\n\ @@ -230,7 +230,7 @@ & \\cdots\n\ & {\\partial f_3 \\over \\partial x_N} \\cr}\\right]$$\n\ @end tex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ | df_1 df_1 df_1 |\n\ @@ -250,7 +250,7 @@ | dx_1 dx_2 dx_N |\n\ @end example\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ The second and third arguments specify the initial state of the system,\n\ @math{x_0}, and the initial value of the independent variable @math{t_0}.\n\
--- a/src/DLD-FUNCTIONS/qr.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/qr.cc Wed Jan 14 20:44:25 2009 -0500 @@ -99,32 +99,32 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ @code{min norm(A x - b)}\n\ @end example\n\ \n\ -@end ifinfo\n\ +@end ifnottex\n\ for overdetermined systems of equations (i.e.,\n\ @iftex\n\ @tex\n\ $A$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{a}\n\ -@end ifinfo\n\ +@end ifnottex\n\ is a tall, thin matrix). The QR factorization is\n\ @iftex\n\ @tex\n\ $QR = A$ where $Q$ is an orthogonal matrix and $R$ is upper triangular.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{q * r = a} where @code{q} is an orthogonal matrix and @code{r} is\n\ upper triangular.\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ If given a second argument of '0', @code{qr} returns an economy-sized\n\ QR factorization, omitting zero rows of @var{R} and the corresponding\n\
--- a/src/DLD-FUNCTIONS/qz.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/qz.cc Wed Jan 14 20:44:25 2009 -0500 @@ -218,9 +218,9 @@ $\\lambda$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @var{lambda}\n\ -@end ifinfo\n\ +@end ifnottex\n\ of @math{(A - s B)}.\n\ @item @code{[AA, BB, Q, Z, V, W, lambda] = qz (A, B)}\n\ \n\ @@ -233,7 +233,7 @@ $$ AA = Q^T AZ, BB = Q^T BZ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @example\n\ @group\n\ \n\ @@ -243,7 +243,7 @@ \n\ @end group\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ with @var{Q} and @var{Z} orthogonal (unitary)= @var{I}\n\ \n\ @item @code{[AA,BB,Z@{, lambda@}] = qz(A,B,opt)}\n\
--- a/src/DLD-FUNCTIONS/schur.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/schur.cc Wed Jan 14 20:44:25 2009 -0500 @@ -52,63 +52,63 @@ $S = U^T A U$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s = u' * a * u}\n\ -@end ifinfo\n\ +@end ifnottex\n\ where\n\ @iftex\n\ @tex\n\ $U$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{u}\n\ -@end ifinfo\n\ +@end ifnottex\n\ is a unitary matrix\n\ @iftex\n\ @tex\n\ ($U^T U$ is identity)\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ (@code{u'* u} is identity)\n\ -@end ifinfo\n\ +@end ifnottex\n\ and\n\ @iftex\n\ @tex\n\ $S$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}\n\ -@end ifinfo\n\ +@end ifnottex\n\ is upper triangular. The eigenvalues of\n\ @iftex\n\ @tex\n\ $A$ (and $S$)\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{a} (and @code{s})\n\ -@end ifinfo\n\ +@end ifnottex\n\ are the diagonal elements of\n\ @iftex\n\ @tex\n\ $S$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ If the matrix\n\ @iftex\n\ @tex\n\ $A$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{a}\n\ -@end ifinfo\n\ +@end ifnottex\n\ is real, then the real Schur decomposition is computed, in which the\n\ matrix\n\ @iftex\n\ @@ -116,18 +116,18 @@ $U$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{u}\n\ -@end ifinfo\n\ +@end ifnottex\n\ is orthogonal and\n\ @iftex\n\ @tex\n\ $S$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}\n\ -@end ifinfo\n\ +@end ifnottex\n\ is block upper triangular\n\ with blocks of size at most\n\ @iftex\n\ @@ -135,27 +135,27 @@ $2\\times 2$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{2 x 2}\n\ -@end ifinfo\n\ +@end ifnottex\n\ along the diagonal. The diagonal elements of\n\ @iftex\n\ @tex\n\ $S$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}\n\ -@end ifinfo\n\ +@end ifnottex\n\ (or the eigenvalues of the\n\ @iftex\n\ @tex\n\ $2\\times 2$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{2 x 2}\n\ -@end ifinfo\n\ +@end ifnottex\n\ blocks, when\n\ appropriate) are the eigenvalues of\n\ @iftex\n\ @@ -163,18 +163,18 @@ $A$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{a}\n\ -@end ifinfo\n\ +@end ifnottex\n\ and\n\ @iftex\n\ @tex\n\ $S$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ The eigenvalues are optionally ordered along the diagonal according to\n\ the value of @code{opt}. @code{opt = \"a\"} indicates that all\n\ @@ -185,9 +185,9 @@ $S$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}\n\ -@end ifinfo\n\ +@end ifnottex\n\ (used in @code{are}), @code{opt = \"d\"} indicates that all eigenvalues\n\ with magnitude less than one should be moved to the leading block of\n\ @iftex\n\ @@ -195,9 +195,9 @@ $S$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}\n\ -@end ifinfo\n\ +@end ifnottex\n\ (used in @code{dare}), and @code{opt = \"u\"}, the default, indicates that\n\ no ordering of eigenvalues should occur. The leading\n\ @iftex\n\ @@ -205,45 +205,45 @@ $k$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{k}\n\ -@end ifinfo\n\ +@end ifnottex\n\ columns of\n\ @iftex\n\ @tex\n\ $U$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{u}\n\ -@end ifinfo\n\ +@end ifnottex\n\ always span the\n\ @iftex\n\ @tex\n\ $A$-invariant\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{a}-invariant\n\ -@end ifinfo\n\ +@end ifnottex\n\ subspace corresponding to the\n\ @iftex\n\ @tex\n\ $k$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{k}\n\ -@end ifinfo\n\ +@end ifnottex\n\ leading eigenvalues of\n\ @iftex\n\ @tex\n\ $S$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{s}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @end deftypefn") { octave_value_list retval;
--- a/src/DLD-FUNCTIONS/svd.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/svd.cc Wed Jan 14 20:44:25 2009 -0500 @@ -50,12 +50,12 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ A = U*S*V'\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ The function @code{svd} normally returns the vector of singular values.\n\ If asked for three return values, it computes\n\ @@ -64,9 +64,9 @@ $U$, $S$, and $V$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ U, S, and V.\n\ -@end ifinfo\n\ +@end ifnottex\n\ For example,\n\ \n\ @example\n\
--- a/src/DLD-FUNCTIONS/syl.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/DLD-FUNCTIONS/syl.cc Wed Jan 14 20:44:25 2009 -0500 @@ -44,12 +44,12 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ A X + X B + C = 0\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ using standard @sc{Lapack} subroutines. For example,\n\ \n\ @example\n\
--- a/src/data.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/data.cc Wed Jan 14 20:44:25 2009 -0500 @@ -3668,9 +3668,9 @@ $0/0$, or $\\infty - \\infty$,\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ 0/0, or @samp{Inf - Inf},\n\ -@end ifinfo\n\ +@end ifnottex\n\ or any operation with a NaN.\n\ \n\ Note that NaN always compares not equal to NaN. This behavior is\n\ @@ -3719,18 +3719,18 @@ $e$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @var{e}\n\ -@end ifinfo\n\ +@end ifnottex\n\ satisfies the equation\n\ @iftex\n\ @tex\n\ $\\log (e) = 1$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{log} (@var{e}) = 1.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @end deftypefn") { #if defined (M_E) @@ -3754,18 +3754,18 @@ floating point system. This number is obviously system-dependent. On\n\ machines that support 64-bit IEEE floating point arithmetic, @code{eps}\n\ is approximately\n\ -@ifinfo\n\ +@ifnottex\n\ 2.2204e-16.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @iftex\n\ @tex\n\ $2.2204\\times10^{-16}$.\n\ @end tex\n\ @end iftex\n\ for double precision and\n\ -@ifinfo\n\ +@ifnottex\n\ 1.1921e-07.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @iftex\n\ @tex\n\ $1.1921\\times10^{-7}$.\n\ @@ -3891,9 +3891,9 @@ to the largest floating point number that is representable. The actual\n\ value is system-dependent. On machines that support 64-bit IEEE\n\ floating point arithmetic, @code{realmax} is approximately\n\ -@ifinfo\n\ +@ifnottex\n\ 1.7977e+308\n\ -@end ifinfo\n\ +@end ifnottex\n\ @iftex\n\ @tex\n\ $1.7977\\times10^{308}$.\n\ @@ -3915,9 +3915,9 @@ to the smallest normalized floating point number that is representable.\n\ The actual value is system-dependent. On machines that support\n\ 64-bit IEEE floating point arithmetic, @code{realmin} is approximately\n\ -@ifinfo\n\ +@ifnottex\n\ 2.2251e-308\n\ -@end ifinfo\n\ +@end ifnottex\n\ @iftex\n\ @tex\n\ $2.2251\\times10^{-308}$.\n\ @@ -3942,9 +3942,9 @@ $\\sqrt{-1}$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{sqrt (-1)}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ Since I (also i, J, and j) is a function, you can use the name(s) for\n\ other purposes.\n\ @end deftypefn")
--- a/src/mappers.cc Wed Jan 14 16:49:45 2009 -0500 +++ b/src/mappers.cc Wed Jan 14 20:44:25 2009 -0500 @@ -45,9 +45,9 @@ $|z| = \\sqrt{x^2 + y^2}$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ |@var{z}| = @code{sqrt (x^2 + y^2)}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ For example,\n\ \n\ @@ -180,9 +180,9 @@ $\\theta = \\tan^{-1}(y/x)$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @var{theta} = @code{atan (@var{y}/@var{x})}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @noindent\n\ in radians. \n\ \n\ @@ -394,9 +394,9 @@ $\\bar{z} = x - iy$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{conj (@var{z})} = @var{x} - @var{i}@var{y}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @seealso{real, imag}\n\ @end deftypefn") { @@ -507,7 +507,7 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @smallexample\n\ z\n\ @@ -516,7 +516,7 @@ /\n\ t=0\n\ @end smallexample\n\ -@end ifinfo\n\ +@end ifnottex\n\ @seealso{erfc, erfinv}\n\ @end deftypefn") { @@ -568,9 +568,9 @@ $1 - {\\rm erf} (z)$.\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ @code{1 - erf (@var{z})}.\n\ -@end ifinfo\n\ +@end ifnottex\n\ @seealso{erf, erfinv}\n\ @end deftypefn") { @@ -739,7 +739,7 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ infinity\n\ @@ -748,7 +748,7 @@ /\n\ t=0\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ @seealso{gammainc, lgamma}\n\ @end deftypefn") { @@ -1335,14 +1335,14 @@ $$\n\ @end tex\n\ @end iftex\n\ -@ifinfo\n\ +@ifnottex\n\ \n\ @example\n\ -1, x < 0;\n\ sign (x) = 0, x = 0;\n\ 1, x > 0.\n\ @end example\n\ -@end ifinfo\n\ +@end ifnottex\n\ \n\ For complex arguments, @code{sign} returns @code{x ./ abs (@var{x})}.\n\ @end deftypefn")