Displaying 10 results from an estimated 10 matches for "max_i".
Did you mean:
max_e
2009 Feb 26
2
[LLVMdev] Impressive performance result for LLVM: complex arithmetic
...tic using gcc and llvm-gcc on a 2.1GHz Opteron 2352 running
Debian:
gcc: 5.727s
llvm-gcc: 1.393s
There is still 20% room for improvement but LLVM is >4x faster than gcc here.
Sweet.
Here's the code:
#include <stdio.h>
#include <stdlib.h>
#include <complex.h>
int max_i = 65536;
double sqr(double x) { return x*x; }
double cnorm2(complex z) { return sqr(creal(z)) + sqr(cimag(z)); }
int loop(complex c) {
complex z=c;
int i=1;
while (cnorm2(z) <= 4.0 && i++ < max_i)
z = z*z + c;
return i;
}
int main() {
for (int j = -39;...
2005 Oct 06
3
playing with R: make a animated GIF file...
Hello all
I am playing with R for to make a animated GIF.
any suggestions, improvements are welcome :-)
case somebody could help me, i thanks!
Cleber N. Borges ( klebyn )
my objective:
(steps TODO)
-------------------
1) to save PNG files;
-----> i don't know the best way to make this;
2) transform the PNG files into GIF files (easy! no problem! ... i
think ...)
3)
2009 Feb 27
0
[LLVMdev] Impressive performance result for LLVM: complex arithmetic
...ian:
>
> gcc: 5.727s
> llvm-gcc: 1.393s
>
> There is still 20% room for improvement but LLVM is >4x faster than gcc here.
> Sweet.
>
> Here's the code:
>
> #include <stdio.h>
> #include <stdlib.h>
> #include <complex.h>
>
> int max_i = 65536;
>
> double sqr(double x) { return x*x; }
>
> double cnorm2(complex z) { return sqr(creal(z)) + sqr(cimag(z)); }
>
> int loop(complex c) {
> complex z=c;
> int i=1;
> while (cnorm2(z) <= 4.0 && i++ < max_i)
> z = z*z + c;
> r...
2006 Oct 17
0
[680] trunk/wxruby2/samples/printing/printing.rb: Cleaned up to use the Ruby naming convention, added #! line, now uses Wx default ID''s in standard menu items.
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
"http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head><meta http-equiv="content-type" content="text/html; charset=utf-8" /><style type="text/css"><!--
#msg dl { border: 1px #006 solid; background: #369; padding:
2011 Mar 22
0
Diagonal population density
Dear all. I have to plot a the marginal population density for a heat map that represents the population density of a city. I have been able to plot the heat map in the lower left corner, the marginal density in x in the upper left corner and the marginal density in y in the lower left corner. What I need is to change this plot to include the marginal density in the diagonal direction of 135
2007 May 22
0
[1030] trunk/wxruby2/samples/printing/printing.rb: Fix so will print again.
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
"http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head><meta http-equiv="content-type" content="text/html; charset=utf-8" /><style type="text/css"><!--
#msg dl { border: 1px #006 solid; background: #369; padding:
2008 Aug 24
2
Missing ids in documentation
I notice some link that didn''t work in the documentation.
By closer inspection I found that some of the headlines missed
id-tags.
The following grep sequence find them.
grep ''<h3'' *.html | grep ''#'' | grep -v ''id=''
Here is the output
brush.html:<h3 class="Brush_getcolour">Brush#get_colour</h3>
2001 Apr 03
3
single-pass algorithm for quantile calculation
Dear R users, I am looking for a reference to an algorithm for estimation of
sample quantiles which does not require bringing the whole data into memory
(more precisely its memory complexity should be much less than linear,
ideally constant). I realize that such an algorithm can only be approximate
and actually quite wrong for some samples, but that's fine with me.
Thank you,
Vadim
2011 Oct 03
1
minimisation problem, two setups (nonlinear with equality constraints/linear programming with mixed constraints)
...ible example.
In principle the problem can be solved by linear programming, so I include code for my attempt at this via RGLPK. It says that there is no feasible solution, but the solution is known analytically in the case below.
Here is the precise problem:
Minimise, over 100?1 real vectors v,
Max_i(|v_i|) such that X'v=e_2,
where X is a given 100?2 matrix and e_2 =(0,1)'. The v_i are the elements of v.
I have put the actual X matrix at the end of this post, along with a feasible starting value for v.
The correct minimum is 0.01287957, obtained with v_i=0.01287957 for i<=50 and...
2007 Mar 27
0
[922] branches/wxruby2/wxwidgets_282: Changes, additions and deprecations 2.6 -> 2.8 Wx API
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
"http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head><meta http-equiv="content-type" content="text/html; charset=utf-8" /><style type="text/css"><!--
#msg dl { border: 1px #006 solid; background: #369; padding: