Parallel GPU implementation of PWR reactor burnup

Heimlich, Adino; Silva, Fernando C.; Martinez, Aquilino Senra

doi:10.1016/j.anucene.2016.01.010

Cited by 14 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A similar problem may occur when evaluating x = cos θ when we have found the approximation of a zero θ near 1 2 π, that is, near x = 0. Assume that n is even, and write n = 2m.…”

Section: Details On Computing Cos χ When We Evaluate the Functionsmentioning

confidence: 73%

“…In §2 we derive two large-n asymptotic expansions in terms of elementary functions valid for x ∈ [−1 + δ, 1 − δ], where δ is a small positive number. Always, α and β should be of order o (1) for large values of n. The expansion in (2.8)-(2.9) is used in §2.2.2 for finding asymptotic expansions of the zeros. The expansion in terms of the J-Bessel function is considered in §3; see (3.4).…”

mentioning

confidence: 99%

See 1 more Smart Citation

Noniterative Computation of Gauss--Jacobi Quadrature

Gil¹,

Segura²,

Temme³

2019

SIAM J. Sci. Comput.

View full text Add to dashboard Cite

Asymptotic approximations to the zeros of Jacobi polynomials are given, with methods to obtain the coefficients in the expansions. These approximations can be used as standalone methods for the non-iterative computation of the nodes of Gauss-Jacobi quadratures of high degree (n ≥ 100). We also provide asymptotic approximations for functions related to the first order derivative of Jacobi polynomials which are used for computing the weights of the Gauss-Jacobi quadrature. The performance of the asymptotic approximations is illustrated with numerical examples, and it is shown that nearly double precision relative accuracy is obtained both for the nodes and the weights when n ≥ 100 and −1 < α, β ≤ 5. For smaller degrees the approximations are also useful as they provide 10 −12 relative accuracy for the nodes when n ≥ 20, and just one Newton step would be sufficient to guarantee double precision accuracy in that cases.

show abstract

“…A similar problem may occur when evaluating x = cos θ when we have found the approximation of a zero θ near 1 2 π, that is, near x = 0. Assume that n is even, and write n = 2m.…”

Section: Details On Computing Cos χ When We Evaluate the Functionsmentioning

confidence: 73%

mentioning

confidence: 99%

Noniterative Computation of Gauss--Jacobi Quadrature

Gil¹,

Segura²,

Temme³

2019

SIAM J. Sci. Comput.

View full text Add to dashboard Cite

show abstract

“…Contingent upon the space of calculation, demonstrative wind field model might be tedious. To conquer tedious (Heimlich et al, 2016) refined the program utilising map segment. Promote the program was refined in 2015, to diminish tedious by adjusting wind field module WindNinja.…”

Section: Related Workmentioning

confidence: 99%

Predicting dispersion of radionuclides through parallel approach

Maheswari

Subha

2018

PIE

View full text Add to dashboard Cite

Radiation release from the accidents of nuclear power plant (NPP) may likely to cause harmful impacts on the individuals and the environment. The discharge of radionuclides and climatic diffusion causes harm to air, water, plants, animals and soil. Mechanism that helps in predicting radionuclides in air will guide individuals to clear from tormented zones. In order to perceive radioactive material dissipation and its outcome in the atmosphere, it is necessary to understand climatic scattering process information about source term (nuclear material released), atmosphere conditions and geographical parts. The climatic scattering framework integrates source, wind field, scattering and dosages counts. This work completely utilises PC to calculate the toxin scattering in the atmosphere. The thought behind is to create parallel calculations giving subtle elements on parallelism of the solver. The calculation is also implemented using C programming.

show abstract

“…The last few years the GPUs (General Purpose Graphic Processing Unit) gave a new perspective on the idea of parallel computation. Thousands of threads working together can execute simultaneously a great number of independent processes [Giitsidis et al, 2015;Heimlich et al, 2016]. Others are searching an effective way to connect many computers in parallel.…”

Section: Introductionmentioning

confidence: 99%

Cellular Automaton Belousov–Zhabotinsky Model for Binary Full Adder

Dourvas

Sirakoulis

Adamatzky

2017

Int. J. Bifurcation Chaos

View full text Add to dashboard Cite

The continuous increment in the performance of classical computers has been driven to its limit. New ways are studied to avoid this oncoming bottleneck and many answers can be found. An example is the Belousov–Zhabotinsky (BZ) reaction which includes some fundamental and essential characteristics that attract chemists, biologists, and computer scientists. Interaction of excitation wave-fronts in BZ system, can be interpreted in terms of logical gates and applied in the design of unconventional hardware components. Logic gates and other more complicated components have been already proposed using different topologies and particular characteristics. In this study, the inherent parallelism and simplicity of Cellular Automata (CAs) modeling is combined with an Oregonator model of light-sensitive version of BZ reaction. The resulting parallel and computationally-inexpensive model has the ability to simulate a topology that can be considered as a one-bit full adder digital component towards the design of an Arithmetic Logic Unit (ALU).

show abstract

Parallel GPU implementation of PWR reactor burnup

Cited by 14 publications

References 10 publications

Noniterative Computation of Gauss--Jacobi Quadrature

Noniterative Computation of Gauss--Jacobi Quadrature

Predicting dispersion of radionuclides through parallel approach

Cellular Automaton Belousov–Zhabotinsky Model for Binary Full Adder

Contact Info

Product

Resources

About