<div class="gmail_quote">On Tue, May 15, 2012 at 10:11 AM, Hui Zhang <span dir="ltr"><<a href="mailto:mike.hui.zhang@hotmail.com" target="_blank">mike.hui.zhang@hotmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div>Yes, see Mandel & Dorhamann' paper <a href="http://ccm.ucdenver.edu/reports/rep194.pdf" target="_blank">http://ccm.ucdenver.edu/reports/rep194.pdf</a> ,</div></blockquote><div><br></div><div>BDDC needs to solve pinned Neumann problems to build the coarse space. There is no way to obtain those Neumann problems from an assembled matrix, and neither PCASM or PCGASM is set up to handle that.</div>
<div><br></div><div>There is a BDDC implementation from Stefano Zampini in petsc-dev, but the code is still not mature so you have to configure --with-pcbddc to activate it.</div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div>but this is for non-overlapping. For overlapping we can see Leong & Widlund </div><div><a href="http://cs.nyu.edu/web/Research/TechReports/TR2008-914/TR2008-914.pdf" target="_blank">http://cs.nyu.edu/web/Research/TechReports/TR2008-914/TR2008-914.pdf</a></div>
</blockquote></div><br><div>This solves non-overlapping Dirichlet problems to construct the coarse basis, then uses overlapping Dirichlet problems for the smoother. Again, these problems are different, so it's not useful to extract the subdomain problems from PC(G)ASM.</div>