I don't like this idea of the matrix type determining the algorithm, I'd rather choose the algorithm.
Can we decouple it by building the prolongation operator P whose columns are harmonic extension of the coarse nodes? Then the coarse operator looks like P^T A P just like multigrid (for which we have a matop) instead of looking like a Schur complement. On May 10, 2012 2:42 PM, "Stefano Zampini" <stefano.zampini at gmail.com> wrote: > > This is to do recursive BDDC or what? >> >> > Yes. When creating the BDDC coarse matrix, now the code has three 3 options > > 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. > -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20120511/89fdc29f/attachment.html>
