[petsc-users] Adaptive implicit method with PETSC

[Matthew Knepley]

On Wed, Dec 17, 2014 at 3:59 PM, Chung-Kan Huang <ckhuangf at gmail.com> wrote:
>
> Hi,
>
> I am trying to find a best way to implement adaptive implicit method
> (AIM) using PETSc for the linear solver.
>
> I am solving conservation equations so if I have a N cells problem then I
> will end of solving a N*M by N*M linear system matrix for each cell has M
> equations (or variables) when I solve them fully implicitly.  For such
> system I can use blocked matrix (BAIJ)
> In case each cell has its implicitness level varing from 1 to M so each
> sub block will have different size range from 1 by to M by M so BAIJ will
> be very inefficient in both storage and computations I supposed.
>
> So I am actually thinking if I should reconstruct matrix and using point
> matrix (AIJ) when implicitness changes but will this also too inefficient
> for constructing a new matrix?
>

This should be alright with AIJ since we have an "inodes" mechanism which
looks like adaptive block size.

  Thanks,

    Matt


>
> So what is the best way for me to implement AIM?
>
> Kan
>
>

-- 
What most experimenters take for granted before they begin their
experiments is infinitely more interesting than any results to which their
experiments lead.
-- Norbert Wiener
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20141217/d406756b/attachment.html>