Permalink
Browse files

more for texinfo 5.0

git-svn-id: https://svn.r-project.org/R/trunk@62432 00db46b3-68df-0310-9c12-caf00c1e9a41
  • Loading branch information...
1 parent 0eeb702 commit 4d71d7601cd6be6f629c024117724721729a4fcc ripley committed Mar 28, 2013
Showing with 18 additions and 29 deletions.
  1. +5 −6 doc/manual/R-admin.texi
  2. +2 −4 doc/manual/R-defs.texi
  3. +11 −19 doc/manual/R-intro.texi
View
11 doc/manual/R-admin.texi
@@ -451,8 +451,7 @@ You will not be able to build any of these unless you have
have @command{texi2dvi} and @file{texinfo.tex} installed (which are part
of the @acronym{GNU} @pkg{texinfo} distribution but are, especially
@file{texinfo.tex}, often made part of the @TeX{} package in
-re-distributions). It should be possible to use @command{makeinfo}
-version 5.0, but e.g..@: 4.13 produces better-formatted output.
+re-distributions).
The PDF versions can be viewed using any recent PDF viewer: they have
hyperlinks that can be followed. The info files are suitable for
@@ -4132,17 +4131,17 @@ the additional flags being needed to resolve problems linking against
@subsection Clang
@R{} has been built with Linux @cputype{ix86} and @cputype{x86_64} C and
-C++ compilers (@uref{http://clang.llvm.org}, versions 3.0 and 3.2) based
-on the Clang front-ends, invoked by @code{CC=clang CXX=clang++},
+C++ compilers (@uref{http://clang.llvm.org}, versions 3.0 and 3.2.2)
+based on the Clang front-ends, invoked by @code{CC=clang CXX=clang++},
together with @command{gfortran}. These take very similar options to
the corresponding GCC compilers.
This has to be used in conjunction with a Fortran compiler: the
@command{configure} code will remove @option{-lgcc} from @env{FLIBS},
which is needed for some versions of @command{gfortran}.
-Note that @command{clang++} 3.0 as in Fedora 17 is rather broken when
-used with @command{g++} C++ headers.
+Note that @command{clang++} 3.0 is rather broken when used with
+@command{g++} C++ headers.
@node Intel compilers, Oracle Solaris Studio compilers, Clang, Linux
@subsection Intel compilers
View
6 doc/manual/R-defs.texi
@@ -17,18 +17,16 @@ S
@acronym{HTML}
@end macro
-@iftex
@macro eqn {t, a}
+@iftex
@tex
$\t\$%
@end tex
-@end macro
@end iftex
@ifnottex
-@macro eqn {t, a}
\a\@c
-@end macro
@end ifnottex
+@end macro
@macro pkg {p}
@strong{\p\}
View
30 doc/manual/R-intro.texi
@@ -2041,17 +2041,13 @@ is the matrix product. If @code{x} is a vector, then
@noindent
is a quadratic form.@footnote{Note that @code{x %*% x} is ambiguous, as
-it could mean either @xTx{}
- or @xxT{},
- where @eqn{@strong{x},x}
- is the column form. In such cases the smaller matrix seems implicitly to be
-the interpretation adopted, so the scalar @xTx{}
- is in this case the result. The matrix @xxT{}
- may be calculated either by @code{cbind(x)%*% x} or @code{x %*% rbind(x)} since the result of @code{rbind()} or
+it could mean either @xTx{} or @xxT{}, where @eqn{@strong{x},x} is the
+column form. In such cases the smaller matrix seems implicitly to be
+the interpretation adopted, so the scalar @xTx{} is in this case the
+result. The matrix @xxT{} may be calculated either by @code{cbind(x)
+%*% x} or @code{x %*% rbind(x)} since the result of @code{rbind()} or
@code{cbind()} is always a matrix. However, the best way to compute
-@xTx{}
- or @xxT{}
- is @code{crossprod(x)} or @code{x %o% x}
+@xTx{} or @xxT{} is @code{crossprod(x)} or @code{x %o% x}
respectively.}
@findex crossprod
@@ -2107,16 +2103,12 @@ but rarely is needed. Numerically, it is both inefficient and
potentially unstable to compute @code{x <- solve(A) %*% b} instead of
@code{solve(A,b)}.
-The quadratic form @eqn{@strong{x^T A^{-1} x} ,@ @code{x %*% A^@{-1@} %*%x} @ }
-, which is used in multivariate computations, should be computed by
+The quadratic form @eqn{@strong{x^T A^{-1} x},@ @code{x %*% A^@{-1@} %*%
+x} @ } which is used in multivariate computations, should be computed by
something like@footnote{Even better would be to form a matrix square
-root @eqn{B, B}
- with @eqn{A = BB^T, A = BB'}
- and find the squared length of the
-solution of @eqn{By = x, By = x},
-perhaps using the Cholesky or
-eigendecomposition of @eqn{A, A}.
-} @code{x %*% solve(A,x)}, rather than
+root @eqn{B, B} with @eqn{A = BB^T, A = BB'} and find the squared length of the
+solution of @eqn{By = x, By = x}, perhaps using the Cholesky or
+eigendecomposition of @eqn{A, A}.} @code{x %*% solve(A,x)}, rather than
computing the inverse of @code{A}.
@node Eigenvalues and eigenvectors, Singular value decomposition and determinants, Linear equations and inversion, Matrix facilities

0 comments on commit 4d71d76

Please sign in to comment.