相关论文: Fast algorithms for computing the Boltzmann collis…
In [L. Liu and S. Jin, Multiscale Model. Simult., 16, 1085-1114, 2018], spectral convergence and long-time decay of the numerical solution towards the global equilibrium of the stochastic Galerkin approximation for the Boltzmann equation…
Quantum computing holds great promise to accelerate scientific computations in fluid dynamics and other classical physical systems. While various quantum algorithms have been proposed for linear flows, developing quantum algorithms for…
In the classical theory of cubic interpolation splines there exists an algorithm which works with only $O\left( n\right)$ arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces…
The transport of charged particles or photons in a scattering medium can be modelled with a Boltzmann equation. The mathematical treatment for scattering in such scenarios is often simplified if evaluated in a frame where the scattering…
For the spatially homogeneous Boltzmann equation with hard po- tentials and Grad's cutoff (e.g. hard spheres), we give quantitative estimates of exponential convergence to equilibrium, and we show that the rate of exponential decay is…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
A fast explicit operator splitting (FEOS) method for the molecular beam epitaxy model has been presented in [Cheng, et al., Fast and stable explicit operator splitting methods for phase-field models, J. Comput. Phys., submitted]. The…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
We present recent results [4, 28, 29] about the quantitative study of the linearized Boltzmann collision operator, and its application to the study of the trend to equilibrium for the spatially homogeneous Boltzmann equation for hard…
We present algorithms for solving spatially nonlocal diffusion models on the unit sphere with spectral accuracy in space. Our algorithms are based on the diagonalizability of nonlocal diffusion operators in the basis of spherical harmonics,…
Numerical calculus algorithms which estimate derivatives and integrals from data series acquired either via measurements or by sampling functions are essential in scientific computing. To date, a few quantum algorithms have been developed…
Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean functions, namely the Walsh spectrum, the cross-correlation…
In this paper we propose a new fast splitting algorithm to solve the Weighted Split Bregman minimization problem in the backward step of an accelerated Forward-Backward algorithm. Beside proving the convergence of the method, numerical…
We develop a spectral method for the spatially homogeneous Boltzmann equation using Burnett polynomials in the basis functions. Using the sparsity of the coefficients in the expansion of the collision term, the computational cost is reduced…
The linearized collision operator of the Boltzmann equation for single species can be written as a sum of a positive multiplication operator, the collision frequency, and a compact integral operator. This classical result has more recently,…
Understanding the singular value spectrum of a matrix $A \in \mathbb{R}^{n \times n}$ is a fundamental task in countless applications. In matrix multiplication time, it is possible to perform a full SVD and directly compute the singular…
We introduce a fast algorithm for computing sparse Fourier transforms supported on smooth curves or surfaces. This problem appear naturally in several important problems in wave scattering and reflection seismology. The main observation is…
We present efficient algorithms to build data structures and the lists needed for fast multipole methods. The algorithms are capable of being efficiently implemented on both serial, data parallel GPU and on distributed architectures. With…
Spherical harmonics provide a smooth, orthogonal, and symmetry-adapted basis to expand functions on a sphere, and they are used routinely in physical and theoretical chemistry as well as in different fields of science and technology, from…