<div dir="ltr">I assume you could also use AO ?<br><br><div class="gmail_quote">On Wed, Jul 27, 2011 at 6:01 AM, Matthew Knepley <span dir="ltr"><<a href="mailto:knepley@gmail.com">knepley@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div><div></div><div class="h5">On Wed, Jul 27, 2011 at 8:22 AM, Stefan Kolb <span dir="ltr"><<a href="mailto:skolb@rocketmail.com" target="_blank">skolb@rocketmail.com</a>></span> wrote:<br>
</div></div><div class="gmail_quote"><div><div></div><div class="h5"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hi,<br>
<br>
I have read in the user-manual that parallel sparse matrices are stored in the<br>
manner that the first n1 rows are stored on the process with rank 0 and the<br>
next n2 rows on the process with rank 1 and so on. My question is now, is it<br>
possible to store for example the rows 0 to 24 and 50 to 74 on process with<br>
rank 0 and 25 to 49 and 75 to 99 on process with rank 1 for a 100x100 matrix<br>
with two processes.<br></blockquote><div><br></div></div></div><div>No. The effect of a permutation is accomplished with a MaOrdering.</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">
Best regards,<br>
<font color="#888888">Stefan<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>
</blockquote></div><br></div>