Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
100% Quality Score
Upvotes Received
1
Posts with Upvotes
1
Upvoting Members
1
Downvotes Received
0
Posts with Downvotes
0
Downvoting Members
0
0 Endorsements
~6K People Reached
Favorite Forums

8 Posted Topics

Member Avatar for deliezer

Hi everyone, I am writing some PDE code, and I am just starting to think about parallelizing it. The code is extremely parallelizable by both CUDA (at the lowest level) and regular threading at the higher level. Specifically, I am coding a matrix multiply, and the matrix is banded, so …

Member Avatar for rubberman
0
222
Member Avatar for eranga246

Also, pi = 3.14, not 3.41. And the area of the cylinder (note spelling) is pi * r * r + 2 * pi * r * h.

Member Avatar for gusano79
0
138
Member Avatar for deliezer

Hi, I would like to write a member function with a default argument, but the value of the default argument I would like to use is the value of the classes data member [CODE] class testdf {// testdf private: const int _defaultVal; public: testdf() : _defaultVal(1) {} int testMF(int arg …

Member Avatar for deliezer
0
137
Member Avatar for deliezer

Hi I am trying to write something that compiles and runs correctly on both Linux and Windows. I am running bash in Ubuntu on Linux, and I try to set environment variables in the makefile just before the compile lines. I then write something in the code like [CODE] int …

Member Avatar for deliezer
0
2K
Member Avatar for deliezer

Hi, I am writing an application in which I make a map of strategies keyed by a string symbol. In order to construct the strategies I pass the constructor a filename, out of which it reads out some data, into an initializing map. It is possible that some data might …

Member Avatar for deliezer
0
330
Member Avatar for vergil1983

What you are looking for is a method for calculating the inverse of the exponential function. If you don't want to use the library exponential, you can implement the Taylor expansion, which is rapidly convergent for all values of x, or even try to accelerate it by getting a good …

Member Avatar for deliezer
0
3K
Member Avatar for K0ns3rv

When testing prime-ness (prim-ity? prime-nitude?) in the function isPrime(), you don't need to go all the way to n. You only need to conduct this search up to sqrt(n), i.e. bool isPrime (int n) { for ( int i = 2; i < sqrt(n); i++ ) { if ( n …

Member Avatar for mrnutty
1
323
Member Avatar for deliezer

Hello, I have a difficult memory error to find. I have narrowed it down to a small piece of code, tiny in fact, but the symptoms are baffling to me. I tried to find it with electric fence, but electric fence found nothing. The problem is complicated by my liberal …

Member Avatar for deliezer
0
91

The End.