search for: 3000x3000

Hello R-Users, I have to invert a matrix 3000X3000 and the solve method doesn't work or it is too slow. Are there any methods to invert a big matrix? Regards Stefan --------------------------------- [[alternative HTML version deleted]]

...ormation of a 2500x2500 matrix (sec): 2.69466666666667 2400x2400 normal distributed random matrix ^1000____ (sec): 1.42433333333333 Sorting of 7,000,000 random values__________________ (sec): 2.34466666666667 2800x2800 cross-product matrix (b = a' * a)_________ (sec): 33.187 Linear regr. over a 3000x3000 matrix (c = a \ b')___ (sec): 14.52 -------------------------------------------- Trimmed geom. mean (2 extremes eliminated): 4.51008013606039 II. Matrix functions -------------------- FFT over 2,400,000 random values____________________ (sec): 1.203 Eigenvalues of a 640x640 random matrix______...

...ormation of a 2500x2500 matrix (sec): 2.69466666666667 2400x2400 normal distributed random matrix ^1000____ (sec): 1.42433333333333 Sorting of 7,000,000 random values__________________ (sec): 2.34466666666667 2800x2800 cross-product matrix (b = a' * a)_________ (sec): 33.187 Linear regr. over a 3000x3000 matrix (c = a \ b')___ (sec): 14.52 -------------------------------------------- Trimmed geom. mean (2 extremes eliminated): 4.51008013606039 II. Matrix functions -------------------- FFT over 2,400,000 random values____________________ (sec): 1.203 Eigenvalues of a 640x640 random matrix______...

Hi everyone, I have a question on parsing speed. I have two functions: F1 F2 As things are now, F2 calls F1 internally: F2 = function(x){ if (something == 1){ y = F1(x) } if (something ==2){ do whatever } } *Assuming there could be some difference*, is is faster to use the code as written above or should I actually write the statements of F1 to make the parsing faster? Regards, Federico

Hello, I've compiled some Fortran code and dyn.loaded it into R as in the "Writing R Extensions" manual. The code receives four large arrays of doubles from R (size about 3000x3000), and runs through several loops with BLAS calls. However, I get a memory corruption error when running it -- the full output is attached at the end. I've been trying to pinpoint and solve the problem, and two things seem odd to me: First, if I run the same code with a much smaller dat...

Buenas tardes a todos, Estoy interesado en realizar varios gráficos y luego guardarlos individualmente como PDF. Hasta ahí todo bien. Sin embargo, el archivo resultante tiene aproximadamente 20MB. Podría alguien por favor indicarme cómo reducir su tamaño? A continuación un ejemplo de lo que intento hacer y mi sessionInfo(). Estoy usando Mac OS X. Muchas gracias, Jorge Ivan Velez # R code

...t;> > and I find that GOTO is faster than ATLAS > >> > consistently (between ~ 5-20%) for several tests > >> > (square matrices; %*% and solve). > >> > ATLAS is still an order of magnitude faster than "plain" for > >> > 3000x3000 matrices. > >> > >> Would you be willing to post a brief summary of > comparative timings? > >> > >> I have thought at times that it may be worthwhile collecting > >> comparative timings for different combinations of > &g...

...either whether this is the correct package to report the bug against, please feel free to reassign it if I am wrong. Bug#1: This first time it happened, I was trying to display a 2200x1200 px png image using qiv, a few days ago. X crashed and I got back to gdm login. Today, I tried to display a 3000x3000 px jpg image[1] in Iceweasel. It first crashed as above. I got a backtrace in Xorg.log featuring calls to the nouveau driver, but cannot be more precise since I sadly lost the trace in subsequent crashes (see below) and have not been able to reproduce it since then. dmesg did not contain anythin...