I've commited more examples, the largest is 64k unknowns (256x256 grid size)
I actually moved all examples to the "examples" directory,
I have found C++ procedural code and CG with that (I think Vladimir's work?).
I can see some C++ classes (Ains?) but it wraps (Reins?) C code and CG
uses C++ procedural code (Vladimirs?). as well as come classes.
Yes, and Reins CG code (currently in SVN) seems to have memory leak
and this can also be in other codes as well.
Seems like 30%+30%+30% but complete mess :)
Feel free to correct me via email or MSN.
~25 seconds, ~1100 iterations with just CG
~4 seconds, 1 iteration with PCG and 1-level preconditioner
But the second test is very unfair and does not show anything, because
it is too small example and it actually uses direct solver - UMFPACK
(I do not want to get into details about preconditioners).
PS. I think that doing that in C and C++ in parallel may be good
thing, because it will show where in C one can hack (optimize) that is
difficult to include into C++ code.
PPS. I can write C++ interfaces for Vector and Matrix which I would
like to see but it is even better to discuss it in MSN tomorrow with
the people concerned about C++ implementation.
Otherwise seems ok, lets see what is possible with 6 SPUs.