Abstract

This paper describes an angular adaptivity algorithm for Boltzmann transport applications which uses Pn and filtered Pn expansions, allowing for different expansion orders across space/energy. Our spatial discretisation is specifically designed to use less memory than competing DG schemes and also gives us direct access to the amount of stabilisation applied at each node. For filtered Pn expansions, we then use our adaptive process in combination with this net amount of stabilisation to compute a spatially dependent filter strength that does not depend on a priori spatial information. This applies heavy filtering only where discontinuities are present, allowing the filtered Pn expansion to retain high-order convergence where possible. Regular and goal-based error metrics are shown and both the adapted Pn and adapted filtered Pn methods show significant reductions in DOFs and runtime. The adapted filtered Pn with our spatially dependent filter shows close to fixed iteration counts and up to high-order is even competitive with P0 discretisations in problems with heavy advection.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call