<div class="gmail_extra"><div class="gmail_quote">On Sat, Apr 28, 2012 at 04:25, Umut Tabak <span dir="ltr"><<a href="mailto:u.tabak@tudelft.nl" target="_blank">u.tabak@tudelft.nl</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Dear all,<br>
<br>
My question is not directly related to PETSc however it fits the audience on this list properly. Where can I find the computational cost analysis on<br>
<br>
+ sparse cholesky factorization,<br>
+ sparse LDL^T factorization,<br>
<br>
in relation to the bandwidth of my sparse matrices. All the references I have present these costs for dense matrices. Where shall I look to get an overview on these costs for sparse/band matrices?<br></blockquote><div><br>
</div><div>All you will get are asymptotics, not sharp operation counts. For 2D, the bounds are O(n^{1.5} flops and O(n log n) space; for 3D they are O(n^2) flops and O(n^{4/3}) space. This is covered in Alan George's book, <a href="http://www.cse.illinois.edu/courses/cs598mh/george_liu.pdf">http://www.cse.illinois.edu/courses/cs598mh/george_liu.pdf</a></div>
<div><br></div></div></div>