<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><br><div><div>On May 15, 2012, at 6:12 PM, Jed Brown wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div class="gmail_quote">On Tue, May 15, 2012 at 10:05 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>I am writing some modified ASM method. In construction of energy minimization coarse basis,</div><div>I need to solve individual subdomain problems and not to sum them, just to extend them separately.</div><div>I wonder whether you guys have ever done this coarse basis.</div>
</blockquote></div><br><div>How are these subdomain problems defined? They are very often different (in terms of overlap or boundary conditions) than are used in the smoother</div></blockquote><div><br></div>With overlap and modified boundary conditions.</div><div><br><blockquote type="cite"><div><br></div><div>You might want to look at PCEXOTIC (<a href="http://www.mcs.anl.gov/petsc/petsc-dev/docs/manualpages/PC/PCEXOTIC.html">http://www.mcs.anl.gov/petsc/petsc-dev/docs/manualpages/PC/PCEXOTIC.html</a>) which is a basic implementation of a two-level DD method of this type.</div>
</blockquote></div><br><div>Yes, this is interesting :) Thanks!</div></body></html>