search for: algebr

Dear R-users, I couldn't find a function or some help in R-project web about the Generalized Singular Value Decomposition. In MatLab there is a simple function for this algebric issue (gsvd). Is there anything like that in R? And, if not, could you help me to apply this method in R? Thanks in advance, Giancarlo +++++ This mail has been sent through the MPI for Demographic Rese...{{dropped}}

Hi, Can anyone tell me, whether it is possible to convert a program into SSA form without considering algebric equivalence ? regards, Chayan

...alpha on the diagonal and beta everywhee else. This symmetric matrix is called symmetric compound matrix and has the form a( I + cJ), where I is the k by k identity matrix J is the k by k matrix of all ones a = alpha - beta c = beta/a I need to evaluate the determinant of this matrix. Is there any algebric formula for that? thank you for your help Stefano [[alternative HTML version deleted]]

Hi Jeffrey, Actually I am trying to implement "E-path PRE" which is based on non-algebric equivallence. So, the variable names need to be preserved. You said that I need to insert these to preserve variable %a.0 = bitcast i32 2 to i32 So, these need to be inserted before the mem2reg pass or within the pass. In first case, how to call an inbuilt pass after doing some analysis from m...

You can use STOREs and LOADs on memory and then use mem2reg pass. 2010/6/1 Chayan Sarkar <chayan.ju at gmail.com>: > Hi, > > Can anyone tell me, whether it is possible to convert a program into > SSA form without considering algebric equivalence ? > > regards, > Chayan > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev >

...Mon, Jun 7, 2010 at 1:58 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Sun, Jun 6, 2010 at 8:56 PM, Chayan Sarkar <chayan.ju at gmail.com> wrote: >> Hi Jeffrey, >> >> Actually I am trying to implement "E-path PRE" which is based on >> non-algebric equivallence. So, the  variable names need to be >> preserved. > > Then why do you want to run mem2reg before your optimization in the first place? > > -Eli >

On Sun, Jun 6, 2010 at 8:56 PM, Chayan Sarkar <chayan.ju at gmail.com> wrote: > Hi Jeffrey, > > Actually I am trying to implement "E-path PRE" which is based on > non-algebric equivallence. So, the  variable names need to be > preserved. Then why do you want to run mem2reg before your optimization in the first place? -Eli

...93160e-07 # females -0.213851446 0.201717381* -1.0601538 2.890746e-01 # smoke 0.160672124 0.214923130* 0.7475795 4.547138e-01 # age -0.001056007 0.004612947 -0.2289223 8.189293e-01 # females:smoke -0.283775173 0.362821438 -0.7821345 4.341355e-01 I have worked out algebrically (and numerically) the following: Beta(females) = -Beta(males) Var(females) = Var(males) Beta(females:smoke) = -Beta(males:smoke) Var(females:smoke) = Var(males:smoke) Beta(smoke | fit1) = Beta(smoke | fit2) + Beta(females:smoke) = 0.1606...

...o at gmail.com> wrote: > You can use STOREs and LOADs on memory and then use mem2reg pass. > > 2010/6/1 Chayan Sarkar <chayan.ju at gmail.com>: >> Hi, >> >> Can anyone tell me, whether it is possible to convert a program into >> SSA form without considering algebric equivalence ? >> >> regards, >> Chayan >> _______________________________________________ >> LLVM Developers mailing list >> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu >> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev >> >

There is no existing pass to do this in LLVM, mostly because it wouldn't be useful for optimizing programs. From your input, mem2reg produces: define i32 @myfunc(i32 %x, i32 %y) nounwind { entry: %cmp = icmp sgt i32 %x, %y ; <i1> [#uses=1] br i1 %cmp, label %if.then, label %if.else if.then: ; preds = %entry %add = add

Suppose my Input function is like : myfunc(int x,int y){ int a=2, b=3,c=5; if(x>y) { c=a+b; a=6; } else { c=a*b; b=4; } a=c+a; c=a+b; } and the output should be : myfunc(int x,int y){ int a.0=2, b.0=3,c.0=5; if(x>y) { c.1=a.0+b.0; a.1=6; } else { c.2=a.0*b.0; b.1=4; }

...sim, ncol=20) Mb1 <- matrix(M[,aeven1], nrow=nsim, ncol=20) for (t in aeven2){ Mhb0[,t] <- M[,(41+t)]-M[,(41-t)] Mhb1[,t] <- M[,(42+t)]-M[,(42-t)] } } Here, the matrix M stores the result for all quantiles (by column) considering each simulation i (by row). Then, I try to make some algebric simulations. I need to calculate Mhb0 such that for each value of t, the column called t in matrix Mhb0 will be the result of the subtraction of column (41-t) from the column (41+t) of the matrix M. To be more precise: for t = 2, 4, 6,... Mhb0 will be a matrix such that in the first column...