Hi all,

So I am working with some nice symmetric and positive definite
discretization, and have been told that algebraic multi-grid methods are
best for solving these types of problems.

I see that there's GAMG and there's Hypre's BoomerAMG (and perhaps others
too?) What exactly is the difference between these two? Do they have very
different implementations under the hood? Does one have better scalability
over another? Or more importantly, when would I choose one over the other?

Thanks,
Justin

Reply via email to