Displaying 7 results from an estimated 7 matches similar to: "'solve' algorithm"
2004 Jan 08
2
(no subject)
Recently I tried to install a package in R version 1.8.1 for Windows. First I
un".tar.gz"ed it and ".zip"ed it back in to be able to use the option Install
package(s) from local zip files...
Unfortunately tis error message appeared:
Error in unpackPkg(pkgs[i], pkgnames[i], lib, installWithVers) :
Malformed bundle DESCRIPTION file, no Contains field
It's
2004 Jan 12
1
Matrix indexes
Two questions about matrix indexing:
Is is correct that V <- V[lower.tri(V, diag=TRUE)] returns the lower
triangular of matrix V, that is: all elements above diagonal are set to zero? I
understand that the triangle of matrix elements of V for which lower.tri is
TRUE are returned while the others (above diagonal) are set to zero (or NA ???).
If D and B are vectors of logicals,
what
2015 Jun 03
2
Problem with shared library and lapack under windows
Hi all,
I have a C function, say Cfun, that calls Lapack's DGEMM routine and I need
to create a shared library to use Cfun inside R. The C file is the following
#include<stdio.h>
#include<R.h>
#include<R_ext/Lapack.h>
void Cfun(double *res, double *X, int *n, int *q)
{
char *ptr_TRANSA, TRANSA='T', *ptr_TRANSB, TRANSB='N';
ptr_TRANSA=&TRANSA;
2004 Jul 27
4
Problems with Lapack's eigen() on 64-bit
I'm only now realizing that we have severe problems with R on our
AMD 'Opteron' and 'Athlon64' clients running Redhat Enterprise
with all 64-bit libraries (AFAICS).
The Lapack problem happens for R-patched and R-devel both on
the Opteron and the Athlon64.
Here are platform details:
o "gcc -v" and "g77 -v" both end with the line
gcc version 3.2.3
2007 Jul 08
0
boot.ci
Dear boot.ers,
I ran a small program for training purposes and ended with problems in
boot.ci
bush <- c(rep(1, 840), rep(0, 660))
> f.mean <- function(y, id) {mean(y[id])}
> bushB <- boot(bush, f.mean, 1000)
> boot.ci(bushB, conf = 0.95, type = c('perc', 'bca'))
Error in bca.ci(boot.out, conf, index[1], L = L, t = t.o, t0 = t0.o, h =
h, :
estimated
2007 Oct 16
1
underdetermined system
Hi, sorry, I'm an idiot.. and I know I'm missing something stupid..
I thought if we solve an underdetermine system with QR, my soln is:
min ||x|| (L2 sense) such that Ax = b
then say i have:
> w <- matrix(c(1, 5), ncol=2)
> sw = 2
> qrW = qr(t(w) %*% w)
> qr.coef(qrW, t(w) %*% sw)
[,1]
[1,] 2
[2,] NA
but we also have soln (0, 2/5) which obviously has a
2016 Mar 24
3
summary( prcomp(*, tol = .) ) -- and 'rank.'
I agree with Kasper, this is a 'big' issue. Does your method of taking only
n PCs reduce the load on memory?
The new addition to the summary looks like a good idea, but Proportion of
Variance as you describe it may be confusing to new users. Am I correct in
saying Proportion of variance describes the amount of variance with respect
to the number of components the user chooses to show? So