search for: tsparsematrix

...x: no visible global function definition for ?edgeDataDefaults? graph.wgtMatrix: no visible global function definition for ?edgeData? Tsp2grNEL: no visible global function definition for ?ftM2graphNEL? coerce,graphAM-sparseMatrix: no visible global function definition for ?edgemode? coerce,graphNEL-TsparseMatrix: no visible global function definition for ?nodes? coerce,graphNEL-TsparseMatrix: no visible global function definition for ?edgemode? coerce,graphNEL-TsparseMatrix: no visible global function definition for ?edgeWeights? Logic,ltCMatrix-ltCMatrix: no visible global function definition for ?forceTr...

Hello everyone Could anybody tell me how to set the following matrix? n2<-matrix(nrow=10185,ncol=10185,seq(0,0,length=103734225)) R answer was Error: cannot allocate vector of size 810423 Kb Are there any solution? I tried to increase the memory size but it didn't work G This message has been scanned for viruses by TRENDMICRO,\ an...{{dropped}}

...he package compiled successfully but while loading Matrix package the installation hanged up - in method for 'coerce' with signature '"sparseMatrix","graphNEL"': no definition for class "graphNEL" in method for 'coerce' with signature '"TsparseMatrix","graphNEL"': no definition for class "graphNEL" Creating a generic function for 'format' from package 'base' in package 'Matrix' Creating a generic function for 'qr.R' from package 'base' in package 'Matrix' Creating a ge...

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, I'm doing some basic operations on large sparse matrices, for example getting a row. it takes close to 30 seconds on a 3Ghz machine, and shots the memory usage up to the sky. I suspect there are dense intermediary steps (which, if true would defeat the purpose of trying to use sparse representaitons). As much as I try understanding the

The bulk is on my forums - the final post for today is: Results to date: A. It looks like I am going to need a newer compiler for C - xlc/xlC V11 apparently does not understand this code: "/data/prj/cran/R-3.2.3/src/main/memory.c", line 2149.31: 1506-046 (S) Syntax error. I will have to check if R-devel has different code before asking for assistence. +2139 #ifdef

.... . . . > [3,] . . . . . > [4,] . . . . . > [5,] . . . . . The reason for the above behavior has been a) efficiency. All the subassignment ( `[<-` ) methods for "RsparseMatrix" objects (of which "dsRMatrix" is a special case) are implemented via TsparseMatrix. b) because of the general attitude that Csparse (and Tsparse to some extent) are well supported in Matrix, and e.g. further operations on Rsparse matrices would *again* go via T* or C* sparse ones, I had decided to keep things Tsparse. [...] > Trying with explicit coercion does n...

...; your R, when the matrix M > is really large and sparse such that its dense version does not > even fit in your computer's RAM. I did know that, so I first calculated whether the dense matrix version of that object would fit in my RAM space and it fit easily so I proceeded. I find the TsparseMatrix indexing easier for my more naive notion of sparsity, although thinking about it now, I think I can see that the CsparseMatrix more closely resembles the "folded vector" design of dense R matrices. I will sometimes coerce CMatrix objeccts to TMatrix objects if I am working on the "i...

Using the Matrix package, how can I create a row-oriented sparse Matrix from scratch populated with some data? By default a column-oriented one is created and I'm aware of the note that the package is optimized for column-oriented ones, but I'm only interested in using it for holding my sparse row-oriented data and doing basic subsetting by rows (even using drop=FALSE). Here is what I

Hi all, I am wondering if this is a bug in the Matrix package or if it something that I am just getting wrong...here is an example: > m = matrix(0,4,4) > dimnames(m) = list(letters[1:4], letters[5:8]) > r = c("a","b","a","d") > m[r,2] = 1 > m e f g h a 0 1 0 0 b 0 1 0 0 c 0 0 0 0 d 0 1 0 0 > M = Matrix(0,4,4) > dimnames(M) =

Hello, I am working with a sparse matrix that is approx. 13,900 by 14,100. My goal is to select a row out of the matrix and create a new matrix with that row repeated 13,900 times without having to do any looping. Example: Starting Matrix: exampleMatrix 3 x 4 sparse Matrix of class "dgCMatrix" [1,] 1 . . . [2,] . 1 . 0.5 [3,] . . 1 .. New Matrix:.. newExampleMatrix 3 x 4 sparse

Fine with me as long as eliminating the inconveniences associated with it can be put on the roadmap. The alias instability and the fact that the user has no way to know if s/he should do ?`foo,numeric-method` or ?`foo,numeric,ANY-method` to find the method has been a long-standing problem. H. On 3/21/19 21:29, Michael Lawrence wrote: If we started over, I'd try to avoid this sort of

>>>>> C W <tmrsg11 at gmail.com> >>>>> on Fri, 20 Oct 2017 15:51:16 -0400 writes: > Thank you for your responses. I guess I don't feel > alone. I don't find the documentation go into any detail. > I also find it surprising that, >> object.size(train$data) > 1730904 bytes >>

Thank you for your responses. I guess I don't feel alone. I don't find the documentation go into any detail. I also find it surprising that, > object.size(train$data) 1730904 bytes > object.size(as.matrix(train$data)) 6575016 bytes the dgCMatrix actually takes less memory, though it *looks* like the opposite. Cheers! On Fri, Oct 20, 2017 at 3:22 PM, David Winsemius