similar to: Generate positive definite matrix with constraints

Hello I am trying to determine wether a given matrix is symmetric and positive matrix. The matrix has real valued elements. I have been reading about the cholesky method and another method is to find the eigenvalues. I cant understand how to implement either of the two. Can someone point me to the right direction. I have used ?chol to see the help but if the matrix is not positive definite it

Hi, I was wondering if function eigen() does something different from the function call eigen() in SAS. I'm in the process of translating a SAS code into a R code and the values of the eigenvectors and eigenvalues of a square matrix came out to be different from the values in SAS. I would also appreciate it if someone can explain the difference in simple terms. I'm pretty new to both

Dear all, I've used the 'prcomp' command to calculate the eigenvalues and eigenvectors of a matrix(gg). Using the command 'principal' from the 'psych' package  I've performed the same exercise. I got the same eigenvalues but different eigenvectors. Is there any reason for that difference? Below are the steps I've followed: 1. PRCOMP #defining the matrix

$ R --version R 1.6.1 (2002-11-01). So I would like to perform principal components analysis on a 16X16 correlation matrix, [princomp(cov.mat=x) where x is correlation matrix], the problem is princomp complains that it is not non-negative definite. I called eigen() on the correlation matrix and found that one of the eigenvectors is close to zero & negative (-0.001832311). Is there any way

Dear All i have a little puzzle about eigenvector in the R. As we know that the eigenvector can be displayed on several form. For example A=matrix(c(1,2,4,3),2,2) if we want to get the eigenvalue and eigenvector, the code followed eigen(A) $values [1] 5 -1 $vectors [,1] [,2] [1,] -0.7071068 -0.8944272 [2,] -0.7071068 0.4472136 however, we also can calculate the vector matrix

Hello Does anybody know how one can compute d largest eigenvalues/eigenvectors in R, like in MATLAB eigs function ? eigen function computes all eigenvectors/eigenvalues, and they are slightly different than those generated by matlab eigs. Thanks in advance -- View this message in context: http://www.nabble.com/matlab-eigs-function-in-R-tp17619641p17619641.html Sent from the R help mailing list

Hello. Consider the following matrix: mp <- matrix(c(0,1/4,1/4,3/4,0,1/4,1/4,3/4,1/2),3,3,byrow=T) > mp [,1] [,2] [,3] [1,] 0.00 0.25 0.25 [2,] 0.75 0.00 0.25 [3,] 0.25 0.75 0.50 The eigenvectors of the previous matrix are 1, 0.25 and 0.25 and it is not a diagonalizable matrix. When you try to find the eigenvalues and eigenvectors with R, R responses: > eigen(mp) $values [1]

DeaR list, I happily use eigen() to compute the eigenvalues and eigenvectors of a fairly large matrix (200x200, say), but it seems over-killed as its rank is limited to typically 2 or 3. I sort of remember being taught that numerical techniques can find iteratively decreasing eigenvalues and corresponding orthogonal eigenvectors, which would provide a nice alternative (once I have the

Dear R-listers Is there anyone who knows why I get different eigenvectors when I run MatLab and R? I run both programs in Windows Me. Can I make R to produce the same vectors as MatLab? #R Matrix PA9900<-c(11/24 ,10/53 ,0/1 ,0/1 ,29/43 ,1/24 ,27/53 ,0/1 ,0/1 ,13/43 ,14/24 ,178/53 ,146/244 ,17/23 ,15/43 ,2/24 ,4/53 ,0/1 ,2/23 ,2/43 ,4/24 ,58/53 ,26/244 ,0/1 ,5/43) #R-syntax

Hello, does anybody know another faster function for random multivariate normal variable simulation? I'm using mvrnorm, but as profiling shows, my algorithm spends approximately 50 % in executing mvrnorm function. Maybe some of you knows much faster function for multivariate normal simulation? I would be very gratefull for advices. -- View this message in context:

Hi, How the eigenvectors output by the eigen() function are ordered. The first column corresponds to the largest eigenvalue? or is the last column as in Octave? I'm performing a spatial-temporal analysis of some climatic variables so my matrices are MxN (locations*time)and I'm looking for the leading EOF's. As I have understand the eigenvectors columns represent those EOF's

Hi, I try to calculate the angle between two first eigenvectors of different covariance matrices of biological phenotypic traits for different populations. My issue here is, that all possibilities to do so seem to normalize the eigenvectors to length 1. Although the helpfile of eigen() states, that using eigen(, symmetric = FALSE, EISPACK =TRUE) skips normalization this is (I guess) not applicable

I thought that the function eigen(A) will return a matrix with eigenvectors that are independent of each other (thus forming a base and the matrix being invertible). This seems not to be the case in the following example A=matrix(c(1,2,0,1),nrow=2,byrow=T) eigen(A) ->ev solve(ev$vectors) note that I try to get the upper triangular form with eigenvalues on the diagonal and (possibly) 1 just

Full_Name: Pierre Legendre Version: 2.1.1 OS: Mac OSX 10.4.3 Submission from: (NULL) (132.204.120.81) I am reporting the mis-behaviour of the function 'eigen' in 'base', for the following input matrix: A <- matrix(c(2,3,4,-1,3,1,1,-2,0),3,3) eigen(A) I obtain the following results, which are incorrect for eigenvalues and eigenvectors 2 and 3 (incorrect imaginary portions):

Hi, dear R pros I try to understand eigen(). I have seen, that eigen() gives the eigenvectors normalized to unit length. What shall I do to get the eigenvectors not normalized to unit length? E.g. take the example: A [,1] [,2] V1 0.7714286 -0.2571429 V2 -0.4224490 0.1408163 Calculating eigen(A) "by hand" gives the eigenvectors (example from Backhaus,

Hi dear R-users I try to reproduce the steps included in a LDA. Concerning the eigenvectors there is a difference to SPSS. In my textbook (Bortz) it says, that the matrix with the eigenvectors V usually are not normalized to the length of 1, but in the way that the following holds (SPSS does the same thing): t(Vstar)%*%Derror%*%Vstar = I where Vstar are the normalized eigenvectors. Derror

I'm using R version 2.0.1 on a Windows 2000 operating system. Here is some actual code I executed: > test [,1] [,2] [1,] 1000 500 [2,] 500 250 > eigen(test, symmetric=T)$values [1] 1.250000e+03 -3.153033e-15 > eigen(test, symmetric=T)$values[2] >= 0 [1] FALSE > eigen(test, symmetric=T, only.values=T)$values [1] 1250 0 > eigen(test, symmetric=T,

Thank you for your reply. Do you have any idea of how to get rid of the errors? I tried Null function to calculate eigenvectors and nearPD to get approximate positive definite matrix first but they also had errors. -- View this message in context: http://r.789695.n4.nabble.com/error-code-1-from-Lapack-routine-dsyevr-tp4702571p4702639.html Sent from the R devel mailing list archive at

All of my resources for numerical analysis show that the spectral decomposition is A = CBC' Where C are the eigenvectors and B is a diagonal matrix of eigen values. Now, using the eigen function in R # Original matrix aa <- matrix(c(1,-1,-1,1), ncol=2) ss <- eigen(aa) # This results yields back the original matrix according to the formula above ss$vectors %*% diag(ss$values) %*%

I am trying to check the results from an Eigen decomposition and I need to force a scalar multiplication. The fundamental equation is: Ax = lx. Where 'l' is the eigen value and x is the eigen vector corresponding to the eigenvalue. 'R' returns the eigenvalues as a vector (e <- eigen(A); e$values). So in order to 'check' the result I would multiply the eigenvalues