search for: ginving

Why do x<-b%*%ginv(A) and x<-solve(A,b) give different results?. It seems that I am missing some basic feature of matrix indexing. e.g.: A<-matrix(c(0,-4,4,0),nrow=2,ncol=2) b<-c(-16,0) x<-b%*%ginv(A);x x<-solve(A,b);x Thanks in advance, Angel

?ginv provides 'Modern Applied Statistics with S' (MASS), 3rd, by Venables and Ripley as the sole reference. I happen to have this book (4th ed) on loan from our library, and as far as I can see, ginv is mentioned there twice, and it is *used*, not *explained* in any way. (It is used on p. 148 in the 4th edition.) ginv does not appear in the index of MASS. ginv is an implementation of

I am using the ginv function from MASS and have run across this problem that I do not understand. If I define the matrix A as below, its g-inverse does not satisfy the Moore-Penrose condition A %*% ginv(A) %*% A = A. The matrix A is X'WX in a quadratic regression using some very large dollar values. The much simpler matrix B does satisfy the MP condition. Am I doing something wrong? Is

since ginv can deal with both singular and non-singular conditions, is there any other difference between them? if I use ginv only, will be any problem? thanks [[alternative HTML version deleted]]

Dear All, While inverting a matrix the following error appears on my console: Error in solve.default(my_matrix) : Lapack routine dgesv: system is exactly singular With this respect, I have been replacing the solve() function with ginv(): the Moore-Penrose generalized inverse of a matrix. These are the questions I would like to ask you: 1. Would you also replace solve() with ginv() in

Dear all; I'm kind of confused with the results obtained using the ginv function from package MASS and pinv function from Matlab. Accroding to the documentation both functions performs a Moore-Penrose generalized inverse of a matrix X. The problem is when I change the tolerance value, say to 1E-3. Here is some output from ginv 195.2674402 235.6758714 335.0830253 8.977515484 -291.7798965

>I'm rusty, but not *that* rusty here, I hope. > >If W (=Z*Z' in your case) is singular, it can not have >inverse, which by >definition also mean that nothing multiply by it will >produce the identity >matrix (for otherwise it would have an inverse and >thus nonsingular). > >The definition of a generalized inverse is something >like: If A is a >non-null

### An numeric problem in R ######## ###I have two matrix one is########## A <- matrix(c(21.97844, 250.1960, 2752.033, 29675.88, 316318.4, 3349550, 35336827, 24.89267, 261.4211, 2691.009, 27796.02, 288738.7, 3011839, 31498784, 21.80384, 232.3765, 2460.495, 25992.77, 274001.6, 2883756, 30318645, 39.85801, 392.2341, 3971.349, 40814.22, 423126.2,

Dear R-help list members, I am hoping to get you help in reproducing a problem I am having That is only reproducible on a large-memory machine. Whenever I run the following lines, get a segfault listed below: *** caught segfault *** address 0x7f092cc46e40, cause 'invalid permissions' Traceback: 1: La.svd(x, nu, nv) 2: svd(X) 3: ginv(bigmatrix) Here is the code that I run:

Dear friends, I am writing a package that I think may be of interest to many people so I am in the process to build-check-write-thedocumentation for it. I have some questions regarding the "rules" that a package should abide in order to be consistent with the other packages on CRAN. I have read and reread the Writing R extension manual and googled the mailing list and I have found

Thorsten is right. There is a direct formula for computing the Moore-Penrose inverse using the singular value composition of a matrix. This is incorporated in the following: mpinv <- function(A, eps = 1e-13) { s <- svd(A) e <- s$d e[e > eps] <- 1/e[e > eps] return(s$v %*% diag(e) %*% t(s$u)) } Hope it helps. Dietrich

Hello, This is in response to a post from a couple of years back regarding Kaiser-Meyer-Olkin Measures of Sampling Adequacy. (http://tolstoy.newcastle.edu.au/R/help/05/12/17233.html) As it turns out, last year Trujillo-Ortiz et al. at the Universidad Autonoma de Baja California wrote and posted a script for MATLAB that does the job. You can see it (with a discussion of KMO statistics) at

Hi, I met a probem recently and need your help. I would really appreciate it. I kept receiving the following error message when running a program: 'Error in svd(X) : infinite or missing values in x'. However, I did not use any svd function in this program though I did include the function pseudoinverse. Is the problem caused by doing pseudoinverse? Best regards, Tongtong

Hello to everybody, I have a quadratic programming problem that I am trying to solve by various methods. One of them is to use the quadprog package in R. When I check positive definiteness of the D matrix, I get that one of the eigenvalues is negative of order 10^(-8). All the others are positive. When I set this particular eigenvalue to 0.0 and I recheck the eigenvalues in R, the last

Hey, I am modelling a linear regression Y=X*B+E. To compute the effect of ?group? the B-values of the regressors/columns that code the interaction effects (col. 5-8 and col. 11-14, see below) have to be weighted with non-zero elements within the contrast "Group 1" minus "Group 2" (see below). My first understanding was that the interaction effects add up to zero in each group.

Hello, I have a question that is not directly related to R ... but I try to do it in R ;-) : I would like to generate a matrix Q satisfying (for a given Z, X and W) the two following conditions: t(Q)%*%Q=Z (1) XQ=W (2) where: Q is m rows and r columns X is p rows and m columns D is p rows and r columns C is r rows and r columns with m>p,r e.g: m=6, p=2 r=3

I am having a problem with the foreign library correctly reading some integer data. Specifically, d _ read.dta('aptaa.dta') > d[1:5,] scenario metcode yr ginv cons gocc abs dvac gmre gmer 1 1 AA 2002 0.007 1377 -0.071 51710 0.071 -0.011 -0.127 2 1 AA 2003 0.000 0 -0.016 62568 0.014 -0.043 -0.538 3 1 AA 2004 0.000 0 -0.002

I have (below) an attempt at an R script to find the limit distribution of a continuous-time Markov process, using the formulae outlined at http://www.uwm.edu/~ziyu/ctc.pdf, page 5. First, is there a better exposition of a practical algorithm for doing this? I have not found an R package that does this specifically, nor anything on the web. Second, the script below will give the right

Generalised Inverse: The Moore-Penrose Generalisied Inverse is probably better defined as a pseudo-Inverse that arises in solving least squares problems. Another well known pseudo-Inverse is the so-called Drazin pseudo-Inverse. If memory serves (and it's been 10-12 years!) it can be obtained via a diagonalisation. Anyway, I dare say Prof. Ripley (among others) probably has "all the

I'm implementing a function to compute the moore-penrose inverse, using a code from the article: Fast Computation of Moore-Penrose Inverse Matrices. Neural Information Processing - Letters and Reviews. Vol.8, No.2, August 2005 However, the R presents an error message when I use the geninv. The odd thing is that the error occurs for some arrays, however they have the same size. And the R