相关论文: ARGOT: Accelerated radiative transfer on grids usi…
In this work, we introduce a fast numerical algorithm to solve the time-dependent radiative transport equation (RTE). Our method uses the integral formulation of RTE and applies the treecode algorithm to reduce the computational complexity…
Under the word RAM model, we design three data structures that can be constructed in $O(n\sqrt{\lg n})$ time over $n$ points in an $n \times n$ grid. The first data structure is an $O(n\lg^{\epsilon} n)$-word structure supporting orthogonal…
The proliferation of data has sparked significant interest in leveraging findings from one study to estimate treatment effects in a different target population without direct outcome observations. However, the transfer learning process is…
Diffusing Alpha-emitters Radiation Therapy (DaRT) is a new method for treating solid tumors using alpha particles. Unlike conventional radiotherapy, where the physical models for dose calculations are known and routinely used, for DaRT a…
We introduce the radiative transfer postprocessing code Subsweep. The code is based on the method of transport sweeps, in which the exact solution to the scattering-less radiative transfer equation is computed in a single pass through the…
We present an ultrafast opacity calculator that we name HELIOS-K. It takes a line list as an input, computes the shape of each spectral line and provides an option for grouping an enormous number of lines into a manageable number of bins.…
An implicit method for the ohmic dissipation is proposed. The proposed method is based on the Crank-Nicolson method and exhibits second-order accuracy in time and space. The proposed method has been implemented in the SFUMATO adaptive mesh…
Purpose: To provide a fast computational method, based on the proximal graph solver (POGS) - a convex optimization solver using the alternating direction method of multipliers (ADMM), for calculating an optimal treatment plan in rotating…
Diffusion planners have shown promise in handling long-horizon and sparse-reward tasks due to the non-autoregressive plan generation. However, their inherent stochastic risk of generating infeasible trajectories presents significant…
We have derived the radiative-transfer equation for a point source with a specified intensity and spectrum, originating in the early Universe between the epochs of annihilation and recombination, at redshifts $z_\s =10^8\div 10^4$. The…
We present a continuum radiative transfer model grid for fitting observed spectral energy distributions (SEDs) of massive protostars. The model grid is based on the paradigm of core accretion theory for massive star formation with…
We develop efficient and high-order accurate solvers for the Helmholtz equation on complex geometry. The schemes are based on the WaveHoltz algorithm which computes solutions of the Helmholtz equation by time-filtering solutions of the wave…
The treatment of radiative transfer with multiple radiation sources is a critical challenge in simulations of star formation and the interstellar medium. In this paper we present the novel TreeRay method for solving general radiative…
A serious concern for semi-analytical galaxy formation models, aiming to simulate multi-wavelength surveys and to thoroughly explore the model parameter space, is the extremely time consuming numerical solution of the radiative transfer of…
To facilitate the study of black hole fueling, star formation, and feedback in galaxies, we outline a method for treating the radial forces on interstellar gas due to absorption of photons by dust grains. The method gives the correct…
Reconstructing the tree of life from molecular sequences is a fundamental problem in computational biology. Modern data sets often contain a large number of genes, which can complicate the reconstruction problem due to the fact that…
We present an updated version of SKIRT, a 3D Monte Carlo radiative transfer code developed to simulate dusty galaxies. The main novel characteristics of the SKIRT code are the use of a stellar foam to generate random positions, an efficient…
New implicit and implicit-explicit time-stepping methods for the wave equation in second-order form are described with application to two and three-dimensional problems discretized on overset grids. The implicit schemes are single step,…
Decision tree optimization is fundamental to interpretable machine learning. The most popular approach is to greedily search for the best feature at every decision point, which is fast but provably suboptimal. Recent approaches find the…
Oblique Decision Tree (ODT) separates the feature space by linear projections, as opposed to the conventional Decision Tree (DT) that forces axis-parallel splits. ODT has been proven to have a stronger representation ability than DT, as it…