Hi Florian, in section 8.2.2 on the Poisson solve, do you know how much of the non-perfect scaling of the solver can be attributed to an increase in the number of CG iterations? In theory the number of iterations should stay constant with a multigrid preconditioner, but I think this is only true if you use geometric MG with a FMG cycle and solve to a tolerance which depends on the grid resolution. I would suspect that the number of iterations grows, so would it be worth mentioning that part of the reason for the poorer scaling of the solver is algorithmic (and say how much the number of iterations increases)? Since the parallel AMG is algorithmically not identical to the sequential version, algorithmic and parallel scalability can only be partly separated, but it might still be worth mentioning it. Thanks, Eike -- Dr Eike Hermann Mueller Research Associate (PostDoc) Department of Mathematical Sciences University of Bath Bath BA2 7AY, United Kingdom +44 1225 38 5633 e.mueller@bath.ac.uk http://people.bath.ac.uk/em459/
On 11 Oct 2014, at 11:27, Florian Rathgeber <florian.rathgeber@imperial.ac.uk> wrote:
I'd still be interested in feedback on this!
On 04/10/14 09:12, Florian Rathgeber wrote: Dear all,
I finished a first draft of the results section for the Firedrake paper. Any feedback gratefully received!
If you don't have access to the repository you can get a PDF from
https://wwwhomes.doc.ic.ac.uk/~fr710/paper.pdf
Cheers, Florian
_______________________________________________ firedrake mailing list firedrake@imperial.ac.uk https://mailman.ic.ac.uk/mailman/listinfo/firedrake