search for: rankmatrix

...y should we compute it every time qr() is called? 1. Because R already does it for linpack so it would be consistent to do so for lapack too. 2. Because R pretends that it is a part of a returned qr class. 3. Because its calculation is a negligible fraction of QR itself. > > ==> Matrix :: rankMatrix() does use "qr" as one of its several methods. > > -------------- > > As wiser people than me have said (I'm paraphrasing, don't find a nice citation): > > While the rank of a matrix is a very well defined concept in > mathematics (theory), its practical...

Le 22/01/2018 ? 17:40, Keith O'Hara a ?crit?: > This behavior is noted in the qr documentation, no? > > rank - the rank of x as computed by the decomposition(*): always full rank in the LAPACK case. For a me a "full rank matrix" is a matrix the rank of which is indeed min(nrow(A), ncol(A)) but here the meaning of "always is full rank" is somewhat confusing. Does it

Hola buenas noches, tengo un problema bastante gordo. ¿A alguno le ha dejado de funcionar las funciones pamer.fnc y mcp.fnc con la nueva versión de R? La semana pasada formatee el ordenador y ahora scripts antiguos no funcionan. La cuestión es que me precupa que no funcione el ejemplo de tutorial del autor. Os dejo un script que debería de funcionar y no lo hace

...er to compute t-values for the coefficients of a (sparse) GLM (i.e. a summary function for class glpModel). Am I going about this the right way? Are they perhaps more efficient ways of doing this when working with sparse matrices. Is there a preferred way of calculating t-statistics? Note that 'rankMatrix' from package Matrix appears to densify the matrix before use, so this is not a viable option. I have asked a similar question before [1], though I am now trying to 'answer' it myself by digging in and actually coding a bit more myself, however, as you can see I'm still a bit stuck...

...itted rank definition (i.e. the number of linearly independent > columns in A) is so easy. Why to discard lapack case from it (even properly documented)? Because 99.5% of caller to qr() never look at '$rank', so why should we compute it every time qr() is called? ==> Matrix :: rankMatrix() does use "qr" as one of its several methods. -------------- As wiser people than me have said (I'm paraphrasing, don't find a nice citation): While the rank of a matrix is a very well defined concept in mathematics (theory), its practical computation on a finite precisi...

Dear all, Rank of a matrix depends on which factors? Only on rows or coumns? or both ? If there is a collinearlity in the variables ( columns ) does it effects the rank? > X<-matrix((rnorm(10000)),50) > dim(X) [1] 50 200 > qr(X)$rank [1] 50 > X[,2]<-X[,30] > qr(X)$rank [1] 50 > X[10,]<-X[7,] > qr(X)$rank [1] 49 Thanks Alex [[alternative HTML

....diag2sT, .diag2mat, drop0, expand, expm, facmul, fac2sparse, fac2Sparse, forceSymmetric, T2graph, graph2T, anyDuplicatedT, uniqTsparse, isTriangular, isDiagonal, isLDL, is.null.DN, invPerm, lu, nearPD, nnzero, formatSpMatrix, formatSparseM, .formatSparseSimple, printSpMatrix, printSpMatrix2, qrR, rankMatrix, readHB, readMM, sparse.model.matrix, sparseVector, symmpart, skewpart, tril, triu, updown, pack, unpack, .updateCHMfactor, .validateCsparse, writeMM, cBind, rBind ERROR: lazy loading failed for package 'rockchalk' * removing 'd:/Rcompile/CRANpkg/lib/3.4/rockchalk' * restoring previ...

...ng some of these functions myself, so any tips/suggestions/resources/examples are appreciated. Furthermore, does anyone know if there facilities to obtain, for example, the rank of the (sparse) model matrix efficiently? Quite a few tests require rank, but computing this separately using for example rankMatrix from package Matrix uses up tonnes of memory, which is exactly what I was trying to avoid by using sparse matrices and glm4 :-p Thanks for any pointers, Carson > sessionInfo() R version 2.12.2 (2011-02-25) Platform: x86_64-pc-linux-gnu (64-bit) locale: [1] LC_CTYPE=en_IE.utf8 LC_NUMER...

...cmul, > fac2sparse, fac2Sparse, forceSymmetric, T2graph, graph2T, > anyDuplicatedT, uniqTsparse, isTriangular, isDiagonal, isLDL, > is.null.DN, invPerm, lu, nearPD, nnzero, formatSpMatrix, > formatSparseM, .formatSparseSimple, printSpMatrix, printSpMatrix2, > qrR, rankMatrix, readHB, readMM, sparse.model.matrix, sparseVector, > symmpart, skewpart, tril, triu, updown, pack, unpack, > .updateCHMfactor, .validateCsparse, writeMM, cBind, rBind > ERROR: lazy loading failed for package 'rockchalk' > * removing 'd:/Rcompile/CRANpkg/lib/...

2017-06-22 20:31 GMT+02:00 Uwe Ligges <ligges at statistik.tu-dortmund.de>: > > > On 22.06.2017 20:09, I?aki ?car wrote: >> >> 2017-06-22 19:49 GMT+02:00 Uwe Ligges <ligges at statistik.tu-dortmund.de>: >>> >>> On 22.06.2017 17:11, Bernd Funovits wrote: >>>> >>>> >>>> Hello, >>>> >>>> I

i am trying to use matinv from the Design package to compute the generalized inverse of the normal equations of a 3x3 design via the sweep operator. That is, for the linear model y = ? + x1 + x2 + x1*x2 where x1, x2 are 3-level factors and dummy coding is being used the matrix to be inverted is X'X = 9 3 3 3 3 3 3 1 1 1 1 1 1 1 1 1 3 3 0 0 1 1 1 1 0 0 1 0 0 1 0 0 3 0 3 0 1 1 1 0 1 0 0 1