Displaying 12 results from an estimated 12 matches for "algebrically".
Did you mean:
algebraically
2004 Aug 30
3
Generalized Singular Value Decomposition (GSVD)
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}}
2010 Jun 01
2
[LLVMdev] Converting into SSA form
Hi,
Can anyone tell me, whether it is possible to convert a program into
SSA form without considering algebric equivalence ?
regards,
Chayan
2006 Sep 26
2
about the determinant of a symmetric compound matrix
Dear R users,
even if this question is not related to an issue about R, probably some of you will be able to help me.
I have a square matrix of dimension k by k with 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 =
2010 Jun 07
2
[LLVMdev] Converting into SSA form
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 my
2010 Jun 01
0
[LLVMdev] Converting into SSA form
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
2010 Jun 07
0
[LLVMdev] Converting into SSA form
E-path PRE requires the program in SSA form like SSAPRE algorithm.
Then it finds the eliminatable path (e-path) for an expression and
converts partially redundant to fully redundant and removes redundancy
Chayan
On 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
2010 Jun 07
1
[LLVMdev] Converting into SSA form
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
working out main effect variance when different parameterization is used and interaction term exists
2010 Jul 13
0
working out main effect variance when different parameterization is used and interaction term exists
...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.160672124...
2010 Jun 05
3
[LLVMdev] Converting into SSA form
But, the mem2reg pass removes all load store instructions. It replaces
all variables by their if possible (kind of constant propagation). I
have generated the bitcode of the source program and the applied the
mem2reg pass and obviously not getting desired thing.
What I want is convert it into SSA form without replacing any variable
by their constant value. Please elaborate on your point.
Also,
2010 Jun 05
0
[LLVMdev] Converting into SSA form
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
2010 Jun 05
2
[LLVMdev] Converting into SSA form
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;
}
2010 Oct 15
0
nomianl response model
Is there a way to estimate a nominal response model?
To be more specific let's say I want to calibrate:
\pi_{v}(\theta_j)=\frac{e^{\xi_{v}+\lambda_{v}\theta_j}}{\sum_{h=1}^m
e^{\xi_{h}+\lambda_{h}\theta_j}}
Where $\theta_j$ is a the dependent variable and I need to estimate
$\xi_{h}$ and $\lambda_{h}$ for $h \in {1...,m}$.
Thank you,
Mauricio Romero
Quantil S.A.S.
Cel: 3112231150