Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

Neutron optics: new algorithm based on Green's functions for simulating waveguides with Dirichlet boundary conditions

Loading...
Thumbnail Image

Full text at PDC

Publication date

2022

Advisors (or tutors)

Editors

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier Science Inc
Citations
Google Scholar

Citation

Abstract

We present a new, efficient and robust method for computing scalar wave propagation for those cases in which Dirichlet boundary conditions play a key role. The algorithm is versatile and it allows to treat reflection, diffraction, waveguiding regime, scattering and free propagation. The analysis is based upon a representation for a slow neutron wavefunction in terms of the incoming wave and integrals, along the boundaries of an unbounded domain, involving a Green's function and certain auxiliary functions (warranting the Dirichlet boundary conditions). The analysis involves Fourier and Hilbert transforms defined only on the boundaries and enables to exploit the detailed advantages of Fast Fourier Transform (FFT) to perform simulations. Our algorithm proves to be highly effective both in terms in running time and memory load, compared to those based on Finite Differences Methods (FDM). Moreover, since the value of the field at each point may be calculated independently, this algorithm allows parallelization in a natural way. (c) 2021 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )

Research Projects

Organizational Units

Journal Issue

Description

CRUE-CSIC (Acuerdos Transformativos 2021) ©2021 The Authors. We acknowledge financial support from Universidad Complutense de Madrid (FECI-EU-17–06) and Ministry of Science and Innovation (Project PGC2018–094684-B-C21), Spain.

UCM subjects

Keywords

Collections