similar to: Fast way to compute largest eigenvector

Hi, If I use the eigen() function to find the eigenvalues of a matrix, how can I find the eigenvector corresponding to the largest eigen value? Thanks! [[alternative HTML version deleted]]

R-3.0.1 rev 62743, binary downloaded from CRAN just now; macosx 10.8.3 Hello, eigen(symmetric=TRUE) behaves strangely when given complex matrices. The following two lines define 'A', a 100x100 (real) symmetric matrix which theoretical considerations [Bochner's theorem] show to be positive definite: jj <- matrix(0,100,100) A <- exp(-0.1*(row(jj)-col(jj))^2) A's being

Dear all, I am currently working on the calculation of eigenvalues (and -vectors) of large matrices. Since these are mostly sparse matrices and I remember some specific functionalities in MATLAB for sparse matrices, I started a research how to optimize the calculation of eigenvalues of a sparse matrix. The function eigen itself works with the LAPACK library which has no special handling for

Hi: I create a hermitian matrix and then perform its singular value decomposition. But when I put it back, I don't get the original hermitian matrix. I am having the same problem with spectral value decomposition as well. I am using R 1.7.0 on Windows. Here is my code: X <- matrix(rnorm(16)+1i*rnorm(16),4) X <- X + t(X) X[upper.tri(X)] <- Conj(X[upper.tri(X)]) Y <-

Hi everybody! I'm new to this list and also to the R program. I'd like to know if there is a function able to convert results into Fractional form like my scientific calculator have. For example: > 1/3 [1] 0.3333333 > function_that_return_a_fraction_from_numbers(0.3333333) [1] 1/3 Thanks Mauro -- Man, he is constantly growing and when he is bound by a set pattern of ideas

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

Dear All, how do I compute the left eigenvector of a matrix? I gather that "eigen" computes the right eigenvectors... Regards, Federico Calboli -- ================================= Federico C. F. Calboli PLEASE NOTE NEW ADDRESS Dipartimento di Biologia Via Selmi 3 40126 Bologna Italy tel (+39) 051 209 4187 fax (+39) 051 251 208 f.calboli at ucl.ac.uk

Dear all I am so glad the R can provide the efficient calculate about eigenvector and eigenvalue. However, i have some puzzle about the procedure of eigen. Fristly, what kind of procedue does the R utilize such that the eigen are obtained? For example, A=matrix(c(1,2,4,3),2,2) we can define the eigenvalue lamda, such as det | 1-lamda 4 | =0 | 2 3-lamda | then

Hello everybody When one is working with complex matrices, "transpose" very nearly always means *Hermitian* transpose, that is, A[i,j] <- Conj(A[j,i]). One often writes A^* for the Hermitian transpose. I have only once seen a "real-life" case where transposition does not occur simultaneously with complex conjugation. And I'm not 100% sure that that wasn't a

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 alls, I found in the literature a technique that has been evaluated as one of the more robust to assess statistically the significance of the loadings in a PCA: bootstrapping the eigenvector (Jackson, Ecology 1993, 74: 2204-2214; Peres-Neto and al. 2003. Ecology 84:2347-2363). However, I'm not able to transform by myself the following steps into a R program, yet? Can someone could help

Hi, I am having trouble with some code that I am dyn.loading. I am writing an interface to ARPACK. I compile my interface (dssimp.cc), and link it against the ARPACK library (libarpack_SUN4.a): g++ -shared -static -fPIC dssimp.cc -o dssimp.so -larpack_SUN4 -lg2c -lm I can dyn.load the code and it appears OK. However, when I call my function, the call to the function in the ARPACK library

G'Day R users! Following an ordination using prcomp, I'd like to test which variables singnificantly contribute to a principal component. There is a method suggested by Peres-Neto and al. 2003. Ecology 84:2347-2363 called "bootstrapped eigenvector". It was asked for that in this forum in January 2005 by J?r?me Lema?tre: "1) Resample 1000 times with replacement entire

Dear R users & Experts, This is just a curiousity, I was wondering why the dominant eigenvetor and eigenvalue of the following matrix is given as the third. I guess this could complicate automatic selection procedures. 0 0 0 0 0 5 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 Please

from ?eigen symmetric: if 'TRUE', the matrix is assumed to be symmetric (or Hermitian if complex) and only its lower triangle is used. If 'symmetric' is not specified, the matrix is inspected for symmetry. I think that could mislead a naive reader as it suggests that, with symmetric=TRUE, the result of eigen() (vectors and values) depends only on

I'm trying to test if a correlation matrix is positive semidefinite. My understanding is that a matrix is positive semidefinite if it is Hermitian and all its eigenvalues are positive. The values in my correlation matrix are real and the layout means that it is symmetric. This seems to satisfy the Hermitian criterion so I figure that my real challenge is to check if the eigenvalues are all

Dear all, I want to compute the eigenvalues of a complex matrix for some statistics. Comparing it to its matlab/octave sibling, I don't get the same eigenvalues in R computing it from the exact same matrix. In R, I used eigen() and arpack() that give different eigenvalues. In matlab/octave I used eig() and eigs() that give out the same eigenvalues but different to the R ones. For real

Hi to all, I have two graphs with the same number of nodes but with different connectivities and also with a different number of clusters. The two graphs represent the same "system" under different "conditions" and then there is a one-to-one correspondence between a given node in the two graphs. It is correct to use the eigenvector centrality score as a measure of the relevance

Hi everybody, I need help in writing a statistical function for bootstrap. Suppose m is a matrix with n cols and p rows, my original data. What I want to do is a bootstrap (using boot from package boot) on eigenvectors from a PCA done on m with a statistic function calculating the eigenvector bootstrap error ratio. If R = number of bootstrap replicates, then my function should look something