home.social

#spheric2019 — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #spheric2019, aggregated by home.social.

  1. By Tesler's law of conservation of complexity
    en.wikipedia.org/wiki/Law_of_c
    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:
    gpusph.org/presentations/spher

    Those slides (if you want you can start at the beginning here <gpusph.org/presentations/spher>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.

    10/

  2. By Tesler's law of conservation of complexity
    en.wikipedia.org/wiki/Law_of_c
    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:
    gpusph.org/presentations/spher

    Those slides (if you want you can start at the beginning here <gpusph.org/presentations/spher>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.

    10/

  3. By Tesler's law of conservation of complexity
    en.wikipedia.org/wiki/Law_of_c
    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:
    gpusph.org/presentations/spher

    Those slides (if you want you can start at the beginning here <gpusph.org/presentations/spher>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.

    10/

  4. By Tesler's law of conservation of complexity
    en.wikipedia.org/wiki/Law_of_c
    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:
    gpusph.org/presentations/spher

    Those slides (if you want you can start at the beginning here <gpusph.org/presentations/spher>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.

    10/

  5. By Tesler's law of conservation of complexity
    en.wikipedia.org/wiki/Law_of_c
    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:
    gpusph.org/presentations/spher

    Those slides (if you want you can start at the beginning here <gpusph.org/presentations/spher>) also give you an idea of what happens to the code. And probably also give you a hint about what the issue is.

    10/

  6. When this post mastodon.social/@coreyspowell/ 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 (<nature.com/articles/s41561-024>) 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 <swiftsim.com>) with Uranus as a test case. You can read the full article here:
    doi.org/10.1093/mnras/stz1606
    and see a high-resolution animation of the Uranus impact, as well as other simulations, at icc.dur.ac.uk/giant_impacts/