Related papers: FARGO: a fast eulerian transport algorithm for dif…
Handling clustering problems are important in data statistics, pattern recognition and image processing. The mean-shift algorithm, a common unsupervised algorithms, is widely used to solve clustering problems. However, the mean-shift…
The frozen Gaussian approximation, proposed in [Lu and Yang, [15]], is an efficient computational tool for high frequency wave propagation. We continue in this paper the development of frozen Gaussian approximation. The frozen Gaussian…
The use of reconfigurable computing, and FPGAs in particular, to accelerate computational kernels has the potential to be of great benefit to scientific codes and the HPC community in general. However, whilst recent advanced in FPGA tooling…
We introduce a fast algorithm for Gaussian process regression in low dimensions, applicable to a widely-used family of non-stationary kernels. The non-stationarity of these kernels is induced by arbitrary spatially-varying vertical and…
This paper seeks an efficient algorithm for stochastic precoding to maximize the long-term average weighted sum rates throughout a multiple-input multiple-output (MIMO) network. Unlike many existing works that assume a particular…
Motion correction is the first in a pipeline of algorithms to analyze calcium imaging videos and extract biologically relevant information, for example the network structure of the neurons therein. Fast motion correction would be especially…
Routing algorithms for public transport, particularly the widely used RAPTOR and its variants, often face performance bottlenecks during the transfer relaxation phase, especially on dense transfer graphs, when supporting unlimited…
We describe a new algorithm to solve the time dependent, frequency integrated radiation transport (RT) equation implicitly, which is coupled to an explicit solver for equations of magnetohydrodynamics (MHD) using {\sf Athena++}. The…
Efficient computation of the optimal transport distance between two distributions serves as an algorithm subroutine that empowers various applications. This paper develops a scalable first-order optimization-based method that computes…
The discrete Fr\'echet distance is a popular measure for comparing polygonal curves. An important variant is the discrete Fr\'echet distance under translation, which enables detection of similar movement patterns in different spatial…
Most of the FFT methods available for homogenization of the mechanical response use the strain/deformation gradient as unknown, imposing their compatibility using Green's functions or projection operators. This implies the allocation of…
In this article we present a new family of high order accurate Arbitrary Lagrangian-Eulerian one-step WENO finite volume schemes for the solution of stiff hyperbolic balance laws. High order accuracy in space is obtained with a standard…
Frequency-resolved optical gating (FROG) is widely used to measure ultrashort laser pulses, also providing an excellent indication of pulse-shape instabilities by disagreement between measured and retrieved FROG traces. FROG, however,…
Efficient and fast predictor-corrector methods are proposed to deal with nonlinear Caputo-Fabrizio fractional differential equations, where Caputo-Fabrizio operator is a new proposed fractional derivative with a smooth kernel. The proposed…
Most stars form in embedded clusters. Stellar flybys may affect the orbital architecture of the systems by exciting the eccentricity and causing dynamical instability. Since, incidentally, the timescale over which a cluster loses its…
Protoplanetary "transition" disks have large, mass-depleted central cavities, yet also deliver gas onto their host stars at rates comparable to disks without holes. The paradox of simultaneous transparency and accretion can be explained if…
We present a common pulse retrieval algorithm (COPRA) that can be used for a broad category of ultrashort laser pulse measurement schemes including frequency-resolved optical gating (FROG), interferometric FROG, dispersion scan, time domain…
We present an explicit multiscale algorithm for solving differential equations for problems with high-frequency modes that can be averaged over by separating and scaling the fast and slow dynamics within a single equation. We introduce a…
We present an efficient and parsimonious algorithm to solve mixed initial/final-value problems. The algorithm optimally limits the memory storage and the computational time requirements: with respect to a simple forward integration, the…
This paper presents a generalized flux-corrected transport (FCT) algorithm, which is shown to be total variation diminishing under some conditions. The new algorithm has improved properties from the standpoint of use and analysis. Results…