;>>
>>>> A) coarse matrix is a MATIS -> multilevel BDDC
>>>> B) coarse matrix is SEQAIJ -> one level BDDC with only one proc (or
>>>> all) solving directly the coarse problem
>>>> C) coarse matrix is MPIAIJ -> one level BDDC with a parallel direct
>>>> solve
>>>>
>>>> I think that PCREDUNDANT can do the job in both cases of options B if
>>>> the matrix would be parallel.
>>>>
>>>
>>
>>
>> --
>> Stefano
>>
>
--
Stefano
-- next part --
An HTML attachment was scrubbed...
URL:
<http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20120512/c6d72b68/attachment.html>
--
An HTML attachment was scrubbed...
URL:
<http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20120512/a60e9a81/attachment.html>
think a bit about what the
> right common operation is for that case. I just feel like we may be getting
> too tightly dependent on the specific BDDC algorithm (which has exponential
> condition number growth in the number of levels), which we probably want to
> generalize in the future.
>
--
Stefano
-- next part --
An HTML attachment was scrubbed...
URL:
<http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20120512/43cb8bc0/attachment.html>
are defining _GNU_SOURCE, it _must_ be defined before any system
> headers are included, see PETSC_DESIRE_FEATURE_TEST_MACROS (petscsys.h and
> config/PETSc/Configure.py:configureFeatureTestMacros()).
>
> 3. I pushed http://petsc.cs.iit.edu/petsc/petsc-dev/rev/81ca8251e64d, but we
> need a more complete solution (including #2).
-- next part --
An HTML attachment was scrubbed...
URL:
<http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20120512/189b6353/attachment.html>
