Bruno Turcksin
Texas A&M University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Bruno Turcksin.
Journal of Numerical Mathematics | 2016
Wolfgang Bangerth; Denis Davydov; Timo Heister; Luca Heltai; Guido Kanschat; Martin Kronbichler; Matthias Maier; Bruno Turcksin; David Wells
Abstract This paper provides an overview of the new features of the finite element library deal.II version 8.5.
Nuclear Science and Engineering | 2010
Bruno Turcksin; Jean C. Ragusa; Wolfgang Bangerth
Abstract We investigate application of goal-oriented mesh adaptivity to the SPN multigroup equations. This technique utilizes knowledge of the computational goal and combines it with mesh adaptivity to accurately and rapidly compute quantities of interest. Specifically, the local error is weighted by the importance of a given cell toward the computational goal, resulting in appropriate goal-oriented error estimates. Even though this approach requires the solution of an adjoint (dual) problem, driven by a specific source term for a given quantity of interest, the work reported here clearly shows the benefits of such a method. We demonstrate the level of accuracy this method can achieve using two-dimensional and three-dimensional numerical test cases for one-group and two-group models and compare results with more traditional mesh refinement and uniformly refined meshes. The test cases consider situations in which the radiative flux of a source is shielded and are designed to prototypically explore the range of conditions under which our methods improve on other refinement algorithms. In particular, they model strong contrasts in material properties, a situation ubiquitous in nuclear engineering.
Transport Theory and Statistical Physics | 2012
Bruno Turcksin; Jean C. Ragusa; Jim E. Morel
It is well known that the diffusion synthetic acceleration (DSA) methods for the Sn equations become ineffective in the Fokker-Planck forward-peaked scattering limit. In response to this deficiency, Morel and Manteuffel (1991) developed an angular multigrid method for the 1-D Sn equations. This method is very effective, costing roughly twice as much as DSA per source iteration, and yielding a maximum spectral radius of approximately 0.6 in the Fokker-Planck limit. Pautz, Adams, and Morel (PAM) (1999) later generalized the angular multigrid to 2-D, but it was found that the method was unstable with sufficiently forward-peaked mappings between the angular grids. The method was stabilized via a filtering technique based on diffusion operators, but this filtering also degraded the effectiveness of the overall scheme. The spectral radius was not bounded away from unity in the Fokker-Planck limit, although the method remained more effective than DSA. The purpose of this article is to recast the multidimensional PAM angular multigrid method without the filtering as an Sn preconditioner and use it in conjunction with the Generalized Minimal RESidual (GMRES) Krylov method. The approach ensures stability and our computational results demonstrate that it is also significantly more efficient than an analogous DSA-preconditioned Krylov method.
ACM Transactions on Mathematical Software | 2016
Bruno Turcksin; Martin Kronbichler; Wolfgang Bangerth
Many operations that need to be performed in modern finite element codes can be described as an operation that needs to be done independently on every cell, followed by a reduction of these local results into a global data structure. For example, matrix assembly, estimating discretization errors, or converting nodal values into data structures that can be output in visualization file formats all fall into this class of operations. Using this realization, we identify a software design pattern that we call WorkStream and that can be used to model such operations and enables the use of multicore shared memory parallel processing. We also describe in detail how this design pattern can be efficiently implemented, and we provide numerical scalability results from its use in the deal.II software library.
arXiv: Numerical Analysis | 2015
Wolfgang Bangerth; Timo Heister; Luca Heltai; Guido Kanschat; Martin Kronbichler; Matthias Maier; Bruno Turcksin; Toby D. Young
Journal of Computational Physics | 2014
Bruno Turcksin; Jean C. Ragusa
Archive of Numerical Software | 2015
Wolfgang Bangerth; Timo Heister; Luca Heltai; Guido Kanschat; Martin Kronbichler; Matthias Maier; Bruno Turcksin; Toby D. Young
Archive | 2011
Damien T. Lebrun-Grandie; Jean C. Ragusa; Bruno Turcksin
Archive | 2009
Bruno Turcksin; Jean C. Ragusa
arXiv: Numerical Analysis | 2018
Arezou Ghesmati; Wolfgang Bangerth; Bruno Turcksin