similar to: Proof for computing sums of squares

Consider the following missing data problem: y = c(1, 2, 2, 2, 3) a = factor(c(1, 1, 1, 2, 2)) b = factor(c(1, 2, 3, 1, 2)) fit = lm(y ~ a + b) anova(fit) Analysis of Variance Table Response: y Df Sum Sq Mean Sq F value Pr(>F) a 1 0.83333 0.83333 1.3637e+33 < 2.2e-16 *** b 2 1.16667 0.58333 9.5461e+32 < 2.2e-16 *** Residuals 1 0.00000 0.00000 ---

Hi. I want to create a plot with Pantone654 as the background. The RGB for this color is (0,61,121), which corresponds to a hex of #003D79. How do I specify the bg parameter for this? All Best, Ethan [[alternative HTML version deleted]]

With this example set.seed(123) A <- matrix(runif(40), nrow = 8) y <- 1:nrow(A) A.laqr <- qr(A, LAPACK=TRUE) both qr.qy(A.laqr,y) and qr.qty(A.laqr,y) give the respective error messages Error in qr.qy(A.laqr, y) : 'b' must be a numeric matrix Error in qr.qty(A.laqr, y) : 'b' must be a numeric matrix However when Lapack is not used as in A.liqr <- qr(A,

Hi. I want to use the text() command to produce graphics text in the (Windows) font Tahoma, but I don't know how to do this. I appreciate any suggestions/ideas you may have. All Best, Ethan [[alternative HTML version deleted]]

The lm() function in R seems to handle the inversion of singular X'X matrices (where there is collinearity between regression inputs) in a way where one of the inputs is dropped and this also seems to be the default behavior in SAS (please let me know if i'm wrong about this). In some other packages (i.e. octave ols() function) the pseudo inverse is computed where singular values less

I just detected, that det() is not working on complex matrices any more, due to the fix to the bug reports noted above. I am not happy with this, as determinants are perfectly usable on complex matrices. AFAIUI the bugs resulted from less than optimal behaviour of qr() in certain cases. IMHO this is due to the unhappy decision to use a default for parameter tol to decide whether the the

R-users E-mail: r-help@r-project.org I have a quenstion on "gam()" in "gam" package. The help of gam() says: 'gam' uses the _backfitting algorithm_ to combine different smoothing or fitting methods. On the other hand, lm.wfit(), which is a routine of gam.fit() contains: z <- .Fortran("dqrls", qr = x * wts, n = n, p = p, y = y *

Hi all, I wonder if this kind of questions are ok in this list... Quick question: What does it mean than the rank of the QR decomposition of a NxN matrix is N-1 ? m: NxN matrix qr(m)$rank equal to (N-1) Long version: I'm doing a manova on a matrix of 10 variables and 16 observations. > dim(tmp) [1] 16 10 > fit <- manova( tmp ~ treatment*mouse ) >results <-

On Thu, 19 Apr 2007, brech at delphioutpost.com wrote: > Full_Name: Christian Brechbuehler > Version: 2.4.1 Patched (2007-03-25 r40917) > OS: Linux 2.6.15-27-adm64-xeon; Ubuntu 6.06.1 LTS > Submission from: (NULL) (24.61.47.236) > > > Splus and R have different ideas about what qr.coef(qr()) should return, > which is fine... but I believe that R has a bug in that it is not

Howdy, I am trying to invert a matrix for the purposes of least squares. I have tried a number of things, and the variety of results has me confused. 1. When I try solve() I get the following: >Error in solve.default(t(X) %*% X) : system is computationally singular: reciprocal condition number = 3.76391e-20 2. When I try qr.solve(), I get: >Error in qr.solve(t(X) %*% X) : singular matrix

Dear R people, I do not have much knowledge about linear algebra but currently I need to understand what the function qr.qty is actually doing. The documentation states that it calculates t(Q) %*% y via a previously performed QR matrix decomposition. In order to do that, I tried following basic example: m<-matrix(c(1,0,0,0,1,0,0,0,1,0,0,1),ncol=3) # 4x3 matrix

When I use the function cancor of mva package, I found that it doesn't work when one of the matrix has only one column, or both have only one column. The function in Splus 5 with the same name works under those situations. The version of R I am using is 0.63.2 (released on Jan., 1999) on Solaris. Kenny Ye Assistant Professor Department of Applied Math and Statistics SUNY at Stony Brook

I haven't found a function that directly calculates the matrix inverse, does it exist? Otherwise what would be the fastest way to do it? Patrik Waldmann -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the

Hi, I installed R-3.1.1 on AIX-5.3 and my installation hanged up while installing Matrix Package. so i killed the gmake ; gmake install the software nad tired installing Matrix package manually - [ncmr0202][/gpfs1/home/shivali/gang/R-3.1.1/bin/package]> /gpfs1/home/shivali/gang/R-3.1.1/bin/R CMD INSTALL Matrix the package compiled successfully but while loading Matrix package the

Dear R experts, I have a Matlab code which I am translating to R in order to examine and enhance it. First of all, I need to reproduce in R the results which were already obtained in Matlab (to make sure that everything is correct). There are some matrix manipulations and '\' operation among them in the code. I have the following data frame > ABS.df Pro syn

Here's my little discussion example for a quadratic regression: http://pj.freefaculty.org/R/WorkingExamples/regression-quadratic-1.R Students press me to know the benefits of poly() over the more obvious regression formulas. I think I understand the theory on why poly() should be more numerically stable, but I'm having trouble writing down an example that proves the benefit of this. I

Hello. I am trying to invert a matrix, and I am finding that I can get different answers depending on whether I set LAPACK true or false using "qr". I had understood that LAPACK is, in general more robust and faster than LINPACK, so I am confused as to why I am getting what seems to be invalid answers. The matrix is ostensibly the Hessian for a function I am optimizing. I want to get

Dear All, Is there is a fast way of refitting lm() when the design matrix stays constant but the response is different? For example, y1 ~ X y2 ~ X y3 ~ X ...etc. where y1 is the 1st instance of the response vector. Calling lm() every time seems rather wasteful since the QR-decomposition of X needs to be calculated only once. It would be nice if qr() was called only once and then the same

Le 22/01/2018 ? 17:40, Keith O'Hara a ?crit?: > This behavior is noted in the qr documentation, no? > > rank - the rank of x as computed by the decomposition(*): always full rank in the LAPACK case. For a me a "full rank matrix" is a matrix the rank of which is indeed min(nrow(A), ncol(A)) but here the meaning of "always is full rank" is somewhat confusing. Does it

Hi, I have noticed different rank values calculated by qr() depending on LAPACK parameter. When it is FALSE (default) a true rank is estimated and returned. Unfortunately, when LAPACK is set to TRUE, the min(nrow(A), ncol(A)) is returned which is only occasionally a true rank. Would not it be more consistent to replace the rank in the latter case by something based on the following pseudo code ?