This paper describes an angular adaptivity algorithm for Boltzmann transport applications which for the first time shows evidence of O(n) scaling in both runtime and memory usage, where n is the number of adapted angles. This adaptivity uses Haar wavelets, which perform structured h-adaptivity built on top of a hierarchical P 0 FEM discretisation of a 2D angular domain, allowing different anisotropic angular resolution to be applied across space/energy. Fixed angular refinement, along with regular and goal-based error metrics are shown in three example problems taken from neutronics/radiative transfer applications. We use a spatial discretisation designed to use less memory than competing alternatives in general applications and gives us the flexibility to use a matrix-free multgrid method as our iterative method. This relies on scalable matrix-vector products using Fast Wavelet Transforms and allows the use of traditional sweep algorithms if desired.

No abstract

No abstract

No abstract

No abstract

No abstract

This paper describes an angular adaptivity algorithm for Boltzmann transport applications which uses P n and filtered P n 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 P n 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 highorder convergence where possible. Regular and goal-based error metrics are shown and both the adapted P n and adapted filtered P n methods show significant reductions in DOFs and runtime. The adapted filtered P n with our spatially dependent filter shows close to fixed iteration counts and up to high-order is even competitive with P 0 discretisations in problems with heavy advection.

A variable order spherical harmonics scheme has been described and employed for the solution of the neutral particle transport equation. The scheme is specifically described with application within the inner-element sub-grid scale finite element spatial discretisation. The angular resolution is variable across both the spatial and energy dimensions. That is, the order of the spherical harmonic expansion may differ at each node of the mesh for each energy group. The variable order scheme has been used to develop adaptive methods for the angular resolution of the particle transport phase-space. Two types of adaptive method have been developed and applied to examples. The first is regular adaptivity, in which the error in the solution over the entire domain is minimised. The second is goal-based adaptivity, in which the error in a specified functional is minimised. The methods were applied to fixed source and eigenvalue examples. Both methods demonstrate an improved accuracy for a given number of degrees of freedom in the angular discretisation.