相关论文: ARGOT: Accelerated radiative transfer on grids usi…

A new second order form of radiative transfer equation (named MSORTE) is proposed, which overcomes the singularity problem of a previously proposed second order radiative transfer equation [J. Comput. Phys. 214 (2006) 12-40 (where it was…

Tucker decomposition has been widely used in a variety of applications to obtain latent factors of tensor data. In these applications, a common need is to compute Tucker decomposition for a given time range. Furthermore, real-world tensor…

This paper introduces a fast algorithm, applicable throughout the electromagnetic spectrum, for the numerical solution of problems of scattering by periodic surfaces in two-dimensional space. The proposed algorithm remains highly accurate…

Near-field magnetic resonance wireless power transfer (WPT) technology has garnered significant attention due to its broad application prospects in medical implants, electric vehicles, and robotics. Addressing the challenges faced by…

This paper develops fast graph Fourier transform (GFT) algorithms with O(n log n) runtime complexity for rank-one updates of the path graph. We first show that several commonly-used audio and video coding transforms belong to this class of…

We present SKIRT, a three-dimensional Monte Carlo radiative transfer code developed to study dusty galaxies. We discuss SKIRT's most important characteristics and present a number of applications. In particular, we focus on the kinematical…

The advent of high density 3D wide azimuth survey configurations has greatly increased the cost of seismic acquisition. Simultaneous source acquisition presents an opportunity to decrease costs by reducing the survey time. Source time…

The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…

We propose in this work a fast numerical algorithm for solving the equation of radiative transfer (ERT) in isotropic media. The algorithm has two steps. In the first step, we derive an integral equation for the angularly averaged ERT…

We propose DisGrem, a fully decentralized second-order method for convex consensus optimization over networks. Each agent solves a local Newton system with vanishing gradient-norm regularization and an eigenvalue-shift stabilizer,…

Contex. Stellar spectra synthesis is essential for the characterization of potential planetary hosts. In addition, comprehensive stellar variability calculations with fast radiative transfer are needed to disentangle planetary transits from…

In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning techniques. By recognizing that a set of samples describes an implicit random geometric graph (RGG), we are…

Scalable spatial GPs for massive datasets can be built via sparse Directed Acyclic Graphs (DAGs) where a small number of directed edges is sufficient to flexibly characterize spatial dependence. The DAG can be used to devise fast algorithms…

We present a specific prescription for the calculation of cosmological power spectra, exploited here at two-loop order in perturbation theory (PT), based on the multi-point propagator expansion. In this approach power spectra are…

A serial asymmetric transmission (AT) nanodevices based on the grating-film-grating (G-F-G) structure are proposed and studied. By showing the results of three different nanodevices as examples, it is proved that this kind of G-F-G…

We present a first-principles calculation on the rate and efficiency of F\"orster resonance energy transfer (FRET) from a donor to an acceptor when they are located in the hotspots of nanoparticle clusters. Nonlocal effect has been…

We discuss the radiative transfer theory for translucent clouds illuminated by an extended background source. First we derive a rigorous solution based on the assumption that multiple scattering produce an isotropic flux. Then we derive a…

We describe a method for fast approximation of sparse coding. The input space is subdivided by a binary decision tree, and we simultaneously learn a dictionary and assignment of allowed dictionary elements for each leaf of the tree. We…

The study of optimal decision trees has gained increasing attention in recent years; however, despite substantial progress, it still suffers from two major challenges: First, trees constructed by existing optimal decision tree (ODT)…

In this paper, we propose the Ordered Median Tree Location Problem (OMT). The OMT is a single-allocation facility location problem where p facilities must be placed on a network connected by a non-directed tree. The objective is to minimize…