#spheric2019 — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #spheric2019, aggregated by home.social.
-
By Tesler's law of conservation of complexity
https://en.wikipedia.org/wiki/Law_of_conservation_of_complexity
there's a lower bound to which you can reduce complexity. Beyond that, you're only moving complexity from one aspect to another.In the case of #GPUSPH, this has materialized in the fact that the exponential complexity of variant support has been converted in what is largely a *linear* complexity of interaction functions. You can find an example in my #SPHERIC2019 presentation:
https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/#9.0Those slides (if you want you can start at the beginning here <https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.
10/
-
By Tesler's law of conservation of complexity
https://en.wikipedia.org/wiki/Law_of_conservation_of_complexity
there's a lower bound to which you can reduce complexity. Beyond that, you're only moving complexity from one aspect to another.In the case of #GPUSPH, this has materialized in the fact that the exponential complexity of variant support has been converted in what is largely a *linear* complexity of interaction functions. You can find an example in my #SPHERIC2019 presentation:
https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/#9.0Those slides (if you want you can start at the beginning here <https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.
10/
-
By Tesler's law of conservation of complexity
https://en.wikipedia.org/wiki/Law_of_conservation_of_complexity
there's a lower bound to which you can reduce complexity. Beyond that, you're only moving complexity from one aspect to another.In the case of #GPUSPH, this has materialized in the fact that the exponential complexity of variant support has been converted in what is largely a *linear* complexity of interaction functions. You can find an example in my #SPHERIC2019 presentation:
https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/#9.0Those slides (if you want you can start at the beginning here <https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.
10/
-
By Tesler's law of conservation of complexity
https://en.wikipedia.org/wiki/Law_of_conservation_of_complexity
there's a lower bound to which you can reduce complexity. Beyond that, you're only moving complexity from one aspect to another.In the case of #GPUSPH, this has materialized in the fact that the exponential complexity of variant support has been converted in what is largely a *linear* complexity of interaction functions. You can find an example in my #SPHERIC2019 presentation:
https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/#9.0Those slides (if you want you can start at the beginning here <https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.
10/
-
By Tesler's law of conservation of complexity
https://en.wikipedia.org/wiki/Law_of_conservation_of_complexity
there's a lower bound to which you can reduce complexity. Beyond that, you're only moving complexity from one aspect to another.In the case of #GPUSPH, this has materialized in the fact that the exponential complexity of variant support has been converted in what is largely a *linear* complexity of interaction functions. You can find an example in my #SPHERIC2019 presentation:
https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/#9.0Those slides (if you want you can start at the beginning here <https://www.gpusph.org/presentations/spheric/2019/bilotta-spheric2019/>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.
10/
-
When this post https://mastodon.social/@coreyspowell/113807316007617909 by @coreyspowell popped up in my feed just now my first thought was: «wait, I'm pretty sure I saw something similar at a recent #SPHERIC conference» so of course I checked the linked paper (<https://www.nature.com/articles/s41561-024-01612-0.epdf?sharing_token=9Q4L9YJs0dXIOXIb7dJ9F9RgN0jAjWel9jnR3ZoTv0NvCuY-CCmAUDS-e_nTUnvNU1gexpN1yz5LgFWb6OYeZtFJos0bQQeDtkY5TswjWh9TsZvZ6a44fcxf1Kw-c1KkueYZqv6G1Lx7wrnS7EBY4v1kIZ-srQuT1Md7nJKtojM%3D>) and lo and behold, they do use #SPH #SmoothedParticleHydrodynamics
However, I had a feeling it wasn't exactly the same, and by digging deeper in my memory, I realized that indeed what I had seen wasn't (a preview of) this work, but a #SPHERIC2019 contribution about simulating impacts on planetary giants with #SWIFT (a well-known SPH code for #astrophysics, the field SPH was originally designed for, available from <https://www.swiftsim.com>) with Uranus as a test case. You can read the full article here:
https://doi.org/10.1093/mnras/stz1606
and see a high-resolution animation of the Uranus impact, as well as other simulations, at https://icc.dur.ac.uk/giant_impacts/