New paper!

I am pleased to announce that the following paper is accepted as a brief announcement at SPAA 2010:

Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem.
Laura Grigori, Pierre-Yves David, James Demmel and Sylvain Peyronnet.

In the paper we derive bounds on communication for sparse Cholesky factorization $latex A = LL^T$ . We focus our analysis on matrices whose graphs satisfy a property, from which a lower bound on the number of flops of the Cholesky factorization can be derived. More information? read the paper!