There is a request to make a more memory efficient version of ASM for running very large system of equations. They are using LU on small diagonal blocks, and have asked that the blocks be factored, applied, and discarded, rather than being saved for all iterations. Does anyone think this is easy in the current ASM code? Have an alternate proposal?
Matt -- What most experimenters take for granted before they begin their experiments is infinitely more interesting than any results to which their experiments lead. -- Norbert Wiener -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20100316/42ac2261/attachment.html>
