Related papers: Explicit error bound of the fast multipole method …
We consider a numerical scheme for the approximation of a system that couples the evolution of a two--dimensional hypersurface to a reaction--diffusion equation on the surface. The surfaces are assumed to be graphs and evolve according to…
Two-time-scale stochastic approximation is a popular iterative method for finding the solution of a system of two equations. Such methods have found broad applications in many areas, especially in machine learning and reinforcement…
This paper proposes a new boundary integral equation (BIE) methodology based on the perfectly matched layer (PML) truncation technique for solving the electromagnetic scattering problems in a multi-layered medium. Instead of using the…
In this paper, exact solutions to the problem of acoustic scattering by elastic spherical symmetric scatterers are developed. The scatterer may consist of an arbitrary number of fluid and solid layers, and scattering with single Neumann…
The Poisson equation governing a planet's gravitational field is posed on the unbounded domain, $\mathbb{R}^3$, whereas finite-element computations require bounded meshes. We implement and compare three strategies for handling the infinite…
An implementation of the fast multiple method (FMM) is performed for magnetic systems with long-ranged dipolar interactions. Expansion in spherical harmonics of the original FMM is replaced by expansion of polynomials in Cartesian…
Hamiltonian Truncation Methods are a useful numerical tool to study strongly coupled QFTs. In this work we present a new method to compute the exact corrections, at any order, in the Hamiltonian Truncation approach presented by Rychkov et…
In this paper, we present a spherical Fast Multipole Method (sFMM) for ray tracing simulation of gravitational lensing (GL) on a curved sky. The sFMM is a non-trivial extension of the Fast Multiple Method (FMM) to sphere $\mathbb S^2$, and…
In this paper we develop a class of efficient Galerkin boundary element methods for the solution of two-dimensional exterior single-scattering problems. Our approach is based upon construction of Galerkin approximation spaces confined to…
A finite element approach to the elastic flow of a curve coupled with a diffusion equation on the curve is analysed. Considering the graph case, the problem is weakly formulated and approximated with continuous linear finite elements, which…
In this paper, we consider finite difference approximations of the second order wave equation. We use finite difference operators satisfying the summation-by-parts property to discretize the equation in space. Boundary conditions and grid…
Multipole expansion of an incident radiation field - that is, representation of the fields as sums of vector spherical wavefunctions - is essential for theoretical light scattering methods such as the T-matrix method and generalised…
This paper considers flow problems in multiscale heterogeneous porous media. The multiscale nature of the modeled process significantly complicates numerical simulations due to the need to compute huge and ill-conditioned sparse matrices,…
In this work we formulate and test a new procedure, the Multiscale Perturbation Method for Two-Phase Flows (MPM-2P), for the fast, accurate and naturally parallelizable numerical solution of two-phase, incompressible, immiscible…
Fractional programming (FP) arises in various communications and signal processing problems because several key quantities in the field are fractionally structured, e.g., the Cram\'{e}r-Rao bound, the Fisher information, and the…
The long-range magnetic field is the most time-consuming part in micromagnetic simulations. Improvements both on a numerical and computational basis can relief problems related to this bottleneck. This work presents an efficient…
There is a Computational fluid dynamics (CFD) method of incorporating the DNN inference to reduce the computational cost. The reduction is realized by replacing some calculations by DNN inference. The cost reduction depends on the…
We provide tools to help automate the error analysis of algorithms that evaluate simple functions over the floating-point numbers. The aim is to obtain tight relative error bounds for these algorithms, expressed as a function of the unit…
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to…
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to…