Related papers: Parallelization Strategies for ALI Radiative Trans…
An efficient computational methodology is used to explore charge transport properties in chemically-modified (and randomly disordered) graphene-based materials. The Hamiltonians of various complex forms of graphene are constructed using…
The highly convergent iterative methods developed by Trujillo Bueno and Fabiani Bendicho (1995) for radiative transfer (RT) applications are generalized to spherical symmetry with velocity fields. These RT methods are based on Jacobi,…
The explosive growth of global data traffic demands scalable and energy-efficient optical communication systems. Spatial division multiplexing (SDM) using multicore or multimode fibers is a promising solution to overcome the capacity limit…
Running parallel applications requires special and expensive processing resources to obtain the required results within a reasonable time. Before parallelizing serial applications, some analysis is recommended to be carried out to decide…
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decomposition. Algorithms for solving polynomial systems combine low-level routines for performing arithmetic operations on…
We discuss work toward developing a 2.5D non-LTE radiative transfer code. Our code uses the short characteristic method with modifications to handle realistic 3D wind velocities. We also designed this code for parallel computing facilities…
Doping of silicon via phosphene exposures alternating with molecular beam epitaxy overgrowth is a path to Si:P substrates for conventional microelectronics and quantum information technologies. The technique also provides a new and…
This article presents an on-line tool (rttools.irap.omp.eu) and its accompanying software ressources for the numerical solution of basic radiation transfer out of local thermodynamic equilibrium (LTE). State-of-the-art stationary iterative…
We generalize the quantum random walk protocol for a particle in a one-dimensional chain, by using several types of biased quantum coins, arranged in aperiodic sequences, in a manner that leads to a rich variety of possible wave function…
Various sectors are likely to carry a set of emerging applications while targeting a reliable communication with low latency transmission. To address this issue, upon a spectrally-efficient transmission, this paper investigates the…
We present an extension of TRAPHIC, the method for radiative transfer of ionising radiation in smoothed particle hydrodynamics simulations that we introduced in Pawlik & Schaye (2008). The new version keeps all advantages of the original…
For combining different single photon channels into single path, we use an effective and reliable technique which is known as quantum multiple access. We take advantage of an add-drop multiplexer capable of pushing and withdrawing a single…
In bidirectional relaying using Physical Layer Network Coding (PLNC), it is generally assumed that users employ same modulation schemes in the Multiple Access phase. However, as observed by Zhang et al., it may not be desirable for the…
The approximate minimum degree algorithm is widely used before numerical factorization to reduce fill-in for sparse matrices. While considerable attention has been given to the numerical factorization process, less focus has been placed on…
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation…
We present a parallel FFT algorithm for SIMD systems following the `Transpose Algorithm' approach. The method is based on the assignment of the data field onto a 1-dimensional ring of systolic cells. The systolic array can be universally…
Generic 2D Hamiltonian systems possess partial barriers in their chaotic phase space that restrict classical transport. Quantum mechanically the transport is suppressed if Planck's constant h is large compared to the classical flux, h >>…
In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some…
We study the problem of synchronizing a general complex network by means of an adaptive strategy in the case where the network topology is slowly time varying and every node receives at each time only one aggregate signal from the set of…
We derive the radiative transfer equation for arbitrary stationary relativistic flows in stationary spacetimes, i.e. for steady-state transfer problems. We show how the standard characteristics method of solution developed by Mihalas and…