1 May
2016
1 May
'16
12:23 p.m.
On 1 May 2016, at 09:51, Martin SCHREIBER <M.Schreiber@exeter.ac.uk> wrote:
It was just a test implementation, but none of the implemented solvers seemed to converge fast enough or only with a very low (and useless) resolution. MG was implemented with a 2x2 <-> 1x1 restr./prolong. CG was only converging if implementing a non-standard residual computation.
I don't know quite what you mean by this, but note that CG minimises the A-norm of the error irrespective of what residual calculation you choose to terminate the iteration. So be careful! Lawrence