Related papers: The Laguerre finite difference one-way equation so…
In this paper, we present an efficient algorithm for the long time behavior of plasma simulations. We will focus on 4D drift-kinetic model, where the plasma's motion occurs in the plane perpendicular to the magnetic field and can be…
When using Laguerre and Hermite spectral methods to numerically solve PDEs in unbounded domains, the number of collocation points assigned inside the region of interest is often insufficient, particularly when the region is expanded or…
We analyze two types of summation-by-parts finite difference operators for approximating the second derivative with variable coefficient. The first type uses ghost points, while the second type does not use any ghost points. A previously…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
We consider large linear and nonlinear fixed point problems, and solution with proximal algorithms. We show that there is a close connection between two seemingly different types of methods from distinct fields: 1) Proximal iterations for…
The multiscale complexity of modern problems in computational science and engineering can prohibit the use of traditional numerical methods in multi-dimensional simulations. Therefore, novel algorithms are required in these situations to…
In this paper, we study the problem of computing the effective diffusivity for particles moving in chaotic flows. Instead of solving a convection-diffusion type cell problem in the Eulerian formulation (arising from homogenization theory…
We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…
We consider the numerical construction of minimal Lagrangian graphs, which is related to recent applications in materials science, molecular engineering, and theoretical physics. It is known that this problem can be formulated as an…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic…
Finite difference method was extended to unstructured meshes to solve Euler equations. The spatial discretization is made of two steps. First, numerical fluxes are computed at the middle point of each edge with high order accuracy. In this…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
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…
Wavelet-based grid adaptation methods use multiresolution analysis for error estimation, offering a mathematically rigorous approach to adaptive grid refinement when solving Partial Differential Equations (PDEs). However, applying these…
In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…
We introduce a new numerical method for solving time-harmonic acoustic scattering problems. The main focus is on plane waves scattered by smoothly varying material inhomogeneities. The proposed method works for any frequency $\omega$, but…
The Lagrange multiplier method has proven highly effective for mitigating the ill-conditioning of full waveform inversion (FWI), enabling robust and computationally efficient algorithms that converge to accurate velocity models even from…
The goal of the present work is to solve a linear dispersive equation with variable coefficient advection on an unbounded domain. In this setting, transparent boundary conditions are vital to allow waves to leave (or even re-enter) the,…