TY - JOUR
T1 - A novel algorithm for incompressible flow using only a coarse grid projection
AU - Lentine, Michael
AU - Zheng, Wen
AU - Fedkiw, Ronald
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): 42959
Acknowledgements: Research supported in part by ONR N0014-06-1-0393, ONR N00014-06-1-0505, ONR N00014-05-1-0479 for a computing cluster, NIH U54-GM072970, NSF ACI-0323866, and King Abdullah University of Science and Technology (KAUST) 42959. M. L. was supported in part by an Intel Ph.D. Fellowship. We would like to thank Christos Kozyrakis for additional computing resources and Jacob Leverich for helping us use those resources.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2010/7/26
Y1 - 2010/7/26
N2 - Large scale fluid simulation can be difficult using existing techniques due to the high computational cost of using large grids. We present a novel technique for simulating detailed fluids quickly. Our technique coarsens the Eulerian fluid grid during the pressure solve, allowing for a fast implicit update but still maintaining the resolution obtained with a large grid. This allows our simulations to run at a fraction of the cost of existing techniques while still providing the fine scale structure and details obtained with a full projection. Our algorithm scales well to very large grids and large numbers of processors, allowing for high fidelity simulations that would otherwise be intractable. © 2010 ACM.
AB - Large scale fluid simulation can be difficult using existing techniques due to the high computational cost of using large grids. We present a novel technique for simulating detailed fluids quickly. Our technique coarsens the Eulerian fluid grid during the pressure solve, allowing for a fast implicit update but still maintaining the resolution obtained with a large grid. This allows our simulations to run at a fraction of the cost of existing techniques while still providing the fine scale structure and details obtained with a full projection. Our algorithm scales well to very large grids and large numbers of processors, allowing for high fidelity simulations that would otherwise be intractable. © 2010 ACM.
UR - http://hdl.handle.net/10754/597356
UR - https://dl.acm.org/doi/10.1145/1778765.1778851
UR - http://www.scopus.com/inward/record.url?scp=77956374788&partnerID=8YFLogxK
U2 - 10.1145/1778765.1778851
DO - 10.1145/1778765.1778851
M3 - Article
SN - 0730-0301
VL - 29
SP - 1
JO - ACM Transactions on Graphics
JF - ACM Transactions on Graphics
IS - 4
ER -