similar to: Help

In summary.manova the qr decomposition of a NxN matrix is calculated and for some cases is giving me a rank < N. However, following suggestions of professor Ripley to calculate the rank of a Matrix On 7 Jun 2002, Brian Ripley wrote: > For a more reliable answer, look at the SVD > (function svd) and look at the > singular values. For example (from lda.default) X.s <-

Hello R'users, I have a quick question. I wanted to know if there exist a function in R to compute the rank of a matrix. I could not find anything about it. Thank you, Raphael -------------- next part -------------- A non-text attachment was scrubbed... Name: raph.vcf Type: text/x-vcard Size: 303 bytes Desc: Card for Raphael Gottardo Url :

Hello everybody, I think my question has been asked before but I am posing it once again since I need it. Is there any way to find the rank of a matrix in R or Splus? ______________________ Indrajit SenGupta Department Of Statistics St. Xavier's College Calcutta University mailto:indra_calisto at yahoo.com mailto:indrajitsg at vsnl.net

On April 15th, Elizabeth wrote: <snip> > In execises 39-42, determine if the columns of the matrix span > R4: <snip> >(or x <- matrix(data=c(7, -5, 6, -7, 2, -3, 10, 9, -5, > 4, -2, 2, 8, -9, 7, 15), nrow=4, ncol=4) > >That is the whole of the question <snip> Have you tried det(x) and/or eigen(x) ? A zero determinant (within

how do I check the rank of a matrix ? say A= 1 0 0 0 1 0 then rank(A)=2 what is this function? thanks I did try help.search("rank"), but all the returned help information seem irrelevant to what I want. I would like to know how people search for help information like this. rank(base) Sample Ranks SignRank(stats) Distribution of the

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

This is kind of like asking for a solution to x+1=x+1. Go back to linear algebra and look up Singular Value Decomposition, and decide if you really want to proceed. See also ?svd and package irlba. -- Sent from my phone. Please excuse my brevity. On April 20, 2016 4:22:34 AM PDT, A A via R-help <r-help at r-project.org> wrote: > > > >I have a situation in R where I would like

I have a situation in R where I would like to find any x (if one exists) that solves the linear system of equations Ax = b, where A is square, sparse, and singular, and b is a vector. Here is some code that mimics my issue with a relatively simple A and b, along with three other methods of solving this system that I found online, two of which give me an error and one of which succeeds on the

Hi folks, I know, this is a fairly common question and I am really disappointed that I could not find a solution. I am trying to calculate Mahanalobis distances in a data frame, where I have several hundreds groups and several hundreds of variables. Whatever I do, however I subset it I get the "system is computationally singular: reciprocal condition number" error. I know what it means

Thorsten is right. There is a direct formula for computing the Moore-Penrose inverse using the singular value composition of a matrix. This is incorporated in the following: mpinv <- function(A, eps = 1e-13) { s <- svd(A) e <- s$d e[e > eps] <- 1/e[e > eps] return(s$v %*% diag(e) %*% t(s$u)) } Hope it helps. Dietrich

I am testing 'qr' with an admittedly contrived matrix and I am getting different results than I am from another package. The matrix that I am using is: x <- matrix(seq(.1, by=.1, length.out=12), 4) So the whole test is: x <- matrix(seq(.1, by=.1, length.out=12), 4) qr(x) And the output from 'R' is: $qr [,1] [,2] [,3] [1,] -0.5477226 -1.2780193

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

Lately I'm getting this error quite a bit: Error in La.svd(x, nu, nv) : error code 1 from Lapack routine 'dgesdd' I'm running R 2.5.0 on a 64 bit Intel machine running Fedora (8 I think). Maybe the 64 bit platform is more fragile about declaring convergence. I'm seeing way more of these errors than I ever have before. From R-Help I see that this issue comes up from time to

Hi everyone, Can I suggest an additional output component in cancor, from package mva? It would be useful to have the number of canonical correlation vectors, equivalently the rank of the covariance between x and y (label "rank"). This would usually be min(dx, dy), where dx and dy have already been computed for the svd function, but there might be situations where it was less than

Has anyone programmed condition indexes in R? I know that there is a function for variance inflation factors available in the car package; however, Belsley (1991) Conditioning Diagnostics (Wiley) notes that there are several weaknesses of VIFs: e.g. 1) High VIFs are sufficient but not necessary conditions for collinearity 2) VIFs don't diagnose the number of collinearities and 3) No one has

I am just about working through Faraways excellent tutorial "practical regression and ANOVA using R" on page 24 he makes the x matrix: x <- cbind(1,gala[,-c(1,2)]) how can I understand this gala[,-c(1,2)])... I couldn't find an explanation of such "c-like" abbreviations anywhere. thanks for a hint. another problem: I couldn't load the faraway library, using the

> Date: Wed, 30 Jun 1999 11:12:24 +0200 (MET DST) > From: Torsten Hothorn <hothorn at amadeus.statistik.uni-dortmund.de> > > yesterday I had a little shock using qr (or lm). having a matrix > > X <- cbind(1,diag(3)) > y <- 1:3 > > the qr.coef returns one NA (because X is singular). So I computed the > Moore-Penrose inverse of X (just from the

//Referring to the response posted many years ago, copied below, what is the specific criterium used for singularity of the gradient matrix? Is a Singular Value Decomposition used to determine the singular values? Is it the gradient matrix condition number or some other criterion for determining singularity? // //Glenn // / / /> What does the error 'singular gradient' mean

Hello,.. Apologies for the newbie question but... I have a matrix R, and I know that *B %*% t(b) = R* *I'm trying to solve for B *(aka. 'factoring the correlation matrix' I think) Please help! I've read that 'to solve for B we define the eigenvalues of R and then apply the techniques of Principal Component Analysis' This made me reach for princomp() but now I'm

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