similar to: COMPUTING DETERMINANT FROM SVD

Hello List, i need help for eigen and svd functions. I have a non-symmetric square matrix. These matrix is not positive (some eigenvalues are negative). I want to diagonalise these matrix. So, I use svd and eigen and i compare the results. eigen give me the "good" eigenvalues (positive and negative). I compare with another software and the results are the same. BUT, when i use svd,

At 01:37 PM 5/10/00 +0200, ralle wrote: >Hi, >I have a problem understanding what is going on with eigen() for >nonsymmetric matrices. >Example: >h<-rnorm(6) >> dim(h)<-c(2,3) >> c<-rnorm(6) "c" is not a great choice of identifier! >> dim(c)<-c(3,2) >> Pi<-h %*% c >> eigen(Pi)$values >[1] 1.56216542 0.07147773 These could

Hi, I'm trying to do PCA on a n by p wide matrix (n < p), and I'd like to get more principal components than there are rows. However, svd() only returns a V matrix of with n columns (instead of p) unless the argument nv=p is set (prcomp calls svd without setting it). Moreover, the eigenvalues returned are always min(n, p) instead of p, even if nv is set: > x <-

Hi All, I performed an svd on a matrix X and saved the first three column of the left singular matrix U. ( I assume that they correspond to the projection of the matrix on the first three eigen vectors that corresponds to the first three largest eigenvalues). I would like to know how much variance is explained by the first eigenvectors? how can I find that. Thanks for your help -- View this

Hey, All In principal component analysis (PCA), we want to know how many percentage the first principal component explain the total variances among the data. Assume the data matrix X is zero-meaned, and I used the following procedures: C = covriance(X) %% calculate the covariance matrix; [EVector,EValues]=eig(C) %% L = diag(EValues) %%L is a column vector with eigenvalues as the elements percent

Dear R-helpers, could anybody explain me briefly what is the difference between eigenvectors returned by 'eigen' and 'svd' functions and how they are related? Thanks in advance Ondrej Mikula

Hello! I suppose this is more a matrix theory question than a question on R, but I will give it a try... I am using La.svd to compute the singular value decomposition (SVD) of a variance matrix, i.e., a symmetric nonnegative definite square matrix. Let S be my variance matrix, and S = U D V' be its SVD. In my numerical experiments I always got U = V. Is this necessarily the case? Or I might

Hello, I have a short question about the prcomp function. First I cite the associated help page (help(prcomp)): "Value: ... SDEV the standard deviations of the principal components (i.e., the square roots of the eigenvalues of the covariance/correlation matrix, though the calculation is actually done with the singular values of the data matrix). ROTATION the matrix of variable loadings

According to R help: princomp() uses eigenvalues of covariance data. prcomp() uses the SVD method. yet when I run the (eg., USArrests) data example and compare with my own "hand-written" versions of PCA I get what looks like the opposite. Example: comparing the variances I see: Using prcomp(USArrests) ------------------------------------- Standard deviations: [1] 83.732400 14.212402

Dear R-users, I have one question about using SVD to get an inverse matrix of covariance matrix Sometimes I met many singular values d are close to 0: look this example $d [1] 4.178853e+00 2.722005e+00 2.139863e+00 1.867628e+00 1.588967e+00 [6] 1.401554e+00 1.256964e+00 1.185750e+00 1.060692e+00 9.932592e-01 [11] 9.412768e-01 8.530497e-01 8.211395e-01 8.077817e-01 7.706618e-01 [16]

Dear R-devel team, I've encountered problems with recent Rs (>= 3.5.3) and MKL. I've followed Dirk's (http://dirk.eddelbuettel.com/blog/2018/04/15/) and Intel's ( https://software.intel.com/en-us/articles/quick-linking-intel-mkl-blas-lapack-to-r) instructions and many versions of MKL. All works fine in my Ubuntu 18 setup for R 3.5.2 and older. Carrying out the install and

Is there a way to determine the SVD of a complex matrix using R? (I'm using v1.0.1 and svd() won't do the trick). I know LAPACK has a function to do this. Thanks -- Ben Stapley Biomolecular Modelling Lab Imperial Cancer Research -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send

Hello, Can you get eigenvalues in addition to eigevectors using prcomp? If so how? I am unable to use princomp due to small sample sizes. Thank you in advance for your help! Rebecca Young -- Rebecca Young Graduate Student Ecology & Evolutionary Biology, Badyaev Lab University of Arizona 1041 E Lowell Tucson, AZ 85721-0088 Office: 425BSW rlyoung at email.arizona.edu (520) 621-4005

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

After fixing princomp(), recently, {tiny negative eigen-values are possible for non-negative definite matrices} Fritz Leisch drew my attention to the fact the not only eigen() can be funny, but also svd(). Adrian Trappleti found that the singular values returned can be "-0" instead of "0". This will be a problem in something like sd <- svd(Mat) $ d

I need to compute generalized eigenvalues. The eigen function in base doesn't do it and I can't find a package that does. As I understand it, Lapack __can__ computer them (http://www.netlib.org/lapack/lawn41/node111.html) and R can use Lapack. If there is no function already, can I access Lapack from R and use those routines directly? Thank you, Joshua Gilbert.

--=====================_24736660==_ Content-Type: text/plain; charset="iso-8859-1"; format=flowed Content-Transfer-Encoding: quoted-printable SVD-Error on R 1.1.0 Windows 98 I get the following error applying svd on a positive definite matrix : > sk2 [,1] [,2] [,3] [,4] [,5] [1,] 1.0460139783 0.084356992 -2.810553e-04

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all, this is probably simple and I'm just doing something stupid, sorry about that :-) I'm trying to convert words (strings of letters) into a fairly small dimensional space (say 10, but anything between about 5 and 50 would be ok), which I will call a feature vector. The the distance between two words represents the similarity of the

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

I am trying to perform Singular Value Decomposition (SVD) on a Term Document Matrix I created using the 'tm' package. Eventually I want to do a Latent Semantic Analysis (LSA). There are 5677 documents with 771 terms (the DTM is 771 x 5677). When I try to do the SVD, it runs out of memory. I am using a 12GB Dual core Machine with Windows XP and don't think I can increase the memory