GMRES provides a cheap estimate of the residual norm at each iteration.
In some cases ("happy breakdown") the iteration can't even proceed. So
there is no point building a subspace of size m, then looking for a
solution. Instead, just run until the estimated residual norm satisfies
the criteria,
Hi:
I am trying to understand the KSPGMRES a little more. In most books (or,
Algorithm 4 in Saad's 1986 paper), I found that the GMRES(m) algorithm
tries to construct a Krylov subspace with size m first, then seek for a
solution that minimize over this space. Therefore, the total iteration
number
Glad it works. Thanks for the update.
Satish
On Sun, 3 Jun 2018, Danyang Su wrote:
> Hi Satish,
>
> Your makefile works.
>
> Please ignore the CGAL dependency. I just modified from CGAL example and it
> needs to be further optimized with the dependency that is required for the
> algorithm I
Hi Satish,
Your makefile works.
Please ignore the CGAL dependency. I just modified from CGAL example and
it needs to be further optimized with the dependency that is required
for the algorithm I use.
Thanks,
Danyang
On 18-06-02 02:51 PM, Satish Balay wrote:
Try the attached makefile.
