Thank you Barry and Matthew. <div><br></div><div>Mohamad</div><div><br><br><div class="gmail_quote">On Tue, Dec 14, 2010 at 7:14 AM, Matthew Knepley <span dir="ltr">&lt;<a href="mailto:knepley@gmail.com">knepley@gmail.com</a>&gt;</span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Yes that is possible. The solver does not know about ghost nodes.<div><br></div><div>   Matt<div><div></div><div class="h5">
<br><br><div class="gmail_quote">On Mon, Dec 13, 2010 at 8:42 PM, Mohamad M. Nasr-Azadani <span dir="ltr">&lt;<a href="mailto:mmnasr@gmail.com" target="_blank">mmnasr@gmail.com</a>&gt;</span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hi guys, <div><br></div><div>A simple question. </div><div>Can I solve a linear system [A]{x} = {b} using KSP solvers using Matrix and rhs, solution vectors with different number of ghost nodes (width)? </div>

<div>As an example, can it be possible to solve for </div>
<div>vector {x} DA, width=3, STAR stencil, </div><div>[A] DA, width=1, STAR stencil </div><div>{b} DA, width=1, STAR stencil</div><div><br></div><div>I am suspecting that it is not possible. </div><div><br></div><div>Thanks, </div>


<div>Mohamad</div><font color="#888888"><div><br></div>
</font></blockquote></div><br><br clear="all"><br></div></div>-- <br>What most experimenters take for granted before they begin their experiments is infinitely more interesting than any results to which their experiments lead.<br>
-- Norbert Wiener<br>

</div>
</blockquote></div><br></div>