10 research outputs found

    P-Multigrid expansion of hybrid multilevel solvers for discontinuous Galerkin finite element discrete ordinate (DG-FEM-SN) diffusion synthetic acceleration (DSA) of radiation transport algorithms

    Get PDF
    Effective preconditioning of neutron diffusion problems is necessary for the development of efficient DSA schemes for neutron transport problems. This paper uses P-multigrid techniques to expand two preconditioners designed to solve the MIP diffusion neutron diffusion equation with a discontinuous Galerkin (DG-FEM) framework using first-order elements. These preconditioners are based on projecting the first-order DG-FEM formulation to either a linear continuous or a constant discontinuous FEM system. The P-multigrid expansion allows the preconditioners to be applied to problems discretised with second and higher-order elements. The preconditioning algorithms are defined in the form of both a V-cycle and W-cycle and applied to solve challenging neutron diffusion problems. In addition a hybrid preconditioner using P-multigrid and AMG without a constant or continuous coarsening is used. Their performance is measured against a computationally efficient standard algebraic multigrid preconditioner. The results obtained demonstrate that all preconditioners studied in this paper provide good convergence with the continuous method generally being the most computationally efficient. In terms of memory requirements the preconditioners studied significantly outperform the AMG

    Scalable angular adaptivity for Boltzmann transport

    Get PDF
    This paper describes an angular adaptivity algorithm for Boltzmann transport applications which for the first time shows evidence of O(n)\mathcal{O}(n) scaling in both runtime and memory usage, where nn is the number of adapted angles. This adaptivity uses Haar wavelets, which perform structured hh-adaptivity built on top of a hierarchical P0_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

    Angular adaptivity with spherical harmonics for Boltzmann transport

    Get PDF
    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.Comment: arXiv admin note: text overlap with arXiv:1901.0492

    Goal-based angular adaptivity for Boltzmann transport in the presence of ray-effects

    No full text
    Boltzmann transport problems often involve heavy streaming, where particles propagate long distance due to the dominance of advection over particle interaction. If an insufficiently refined non-rotationally invariant angular discretisation is used, there are areas of the problem where no particles will propagate. These “ray-effects” are problematic for goal-based error metrics with angular adaptivity, as the metrics in the pre-asymptotic region will be zero/incorrect and angular adaptivity will not occur. In this work we use low-order filtered spherical harmonics, which are rotationally invariant and hence not subject to ray-effects, to “bootstrap” our error metric and enable highly refined anisotropic angular adaptivity with a Haar wavelet angular discretisation. We test this on three simple problems with pure streaming in which traditional error metrics fail. We show our method is robust and produces adapted angular discretisations that match results produced by fixed a priori refinement with either reduced runtime or a constant additional cost even with angular refinement

    Hybrid multi-level solvers for discontinuous Galerkin finite element discrete ordinate (DG-FEM-SN) diffusion synthetic acceleration (DSA) of radiation transport algorithms

    No full text
    his paper examines two established preconditioners which were developed to accelerate the solution of discontinuous Galerkin nite element method (DG- FEM) discretisations of the elliptic neutron di usion equation. They are each presented here as a potential way to accelerate the solution of the Modi ed In- terior Penalty (MIP) form of the discontinuous di usion equation, for use as a di usion synthetic acceleration (DSA) of DG-FEM discretisations of the neutron transport equation. The preconditioners are both two-level schemes, di ering in the low-level space utilised. Once projected to the low-level space a selection of algebraic multigrid (AMG) preconditioners are utilised to obtain a further correction step, these are therefore \hybrid" preconditioners. The rst precon- ditioning scheme utilises a continuous piece-wise linear nite element method (FEM) space, while the second uses a discontinuous piece-wise constant space. Both projections are used alongside an element-wise block Jacobi smoother in order to create a symmetric preconditioning scheme which may be used along- side a conjugate gradient algorithm. An eigenvalue analysis reveals that both should aid convergence but the piece-wise constant based method struggles with some of the smoother error modes. Both are applied to a range of problems in- cluding some which are strongly heterogeneous. In terms of conjugate gradient (CG) iterations needed to reach convergence and computational time required, both methods perform well. However, the piece-wise linear continuous scheme appears to be the more e ective of the two. An analysis of computer memory usage found that that the discontinuous piece-wise constant method had the lowest memory requirements

    A comparison of element agglomeration algorithms for unstructured geometric multigrid

    No full text
    This paper compares the performance of seven different element agglomeration algorithms on unstructured triangular/tetrahedral meshes when used as part of a geometric multigrid. Five of these algorithms come from the literature on AMGe multigrid and mesh partitioning methods. The resulting multigrid schemes are tested matrix-free on two problems in 2D and 3D taken from radiation transport applications; one of which is in the diffusion limit. In two dimensions all coarsening algorithms result in multigrid methods which perform similarly, but in three dimensions aggressive element agglomeration performed by METIS produces the shortest runtimes and multigrid setup times

    Guidelines for Perioperative Care in Elective Colorectal Surgery: Enhanced Recovery After Surgery (ERAS®) Society Recommendations: 2018

    No full text

    Mapping the human genetic architecture of COVID-19

    Get PDF
    The genetic make-up of an individual contributes to the susceptibility and response to viral infection. Although environmental, clinical and social factors have a role in the chance of exposure to SARS-CoV-2 and the severity of COVID-191,2, host genetics may also be important. Identifying host-specific genetic factors may reveal biological mechanisms of therapeutic relevance and clarify causal relationships of modifiable environmental risk factors for SARS-CoV-2 infection and outcomes. We formed a global network of researchers to investigate the role of human genetics in SARS-CoV-2 infection and COVID-19 severity. Here we describe the results of three genome-wide association meta-analyses that consist of up to 49,562 patients with COVID-19 from 46 studies across 19 countries. We report 13 genome-wide significant loci that are associated with SARS-CoV-2 infection or severe manifestations of COVID-19. Several of these loci correspond to previously documented associations to lung or autoimmune and inflammatory diseases3,4,5,6,7. They also represent potentially actionable mechanisms in response to infection. Mendelian randomization analyses support a causal role for smoking and body-mass index for severe COVID-19 although not for type II diabetes. The identification of novel host genetic factors associated with COVID-19 was made possible by the community of human genetics researchers coming together to prioritize the sharing of data, results, resources and analytical frameworks. This working model of international collaboration underscores what is possible for future genetic discoveries in emerging pandemics, or indeed for any complex human disease

    A second update on mapping the human genetic architecture of COVID-19

    Get PDF
    corecore