On Wed, Oct 27, 2010 at 6:09 PM, Shao-Ching Huang <span dir="ltr"><<a href="mailto:huangsc@gmail.com">huangsc@gmail.com</a>></span> wrote:<br><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
Hi,<br>
<br>
I need to solve M*x=f, where matrix M consists of 4 blocks:<br>
[ A B;<br>
C D ]<br>
<br>
I already have old code to build petsc sparse matrices A, B, C and D<br>
and the RHS vectors f1 and f2<br>
(such that f=[f1; f2]), each having global indices starting from 0.<br>
<br>
My question is: is there already API(s) that I can easily assemble<br>
matrices A,B,C and D into M? Or do I have to build M from scratch?<br></blockquote><div><br></div><div>I think the right thing to do is build M from scratch. Its unlikely that you actually</div><div>want the parallel matrix to be partitioned this way.</div>
<div><br></div><div> Matt</div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
Thanks,<br>
<font color="#888888"><br>
Shao-Ching<br>
</font></blockquote></div><br><br clear="all"><br>-- <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>