English
Related papers

Related papers: Fast algorithms for integral formulations of stead…

200 papers

We describe an algorithm for the application of the forward and inverse spherical harmonic transforms. It is based on a new method for rapidly computing the forward and inverse associated Legendre transforms by hierarchically applying the…

Numerical Analysis · Mathematics 2021-08-31 James Bremer , Ze Chen , Haizhao Yang

This paper analyzes inverse scattering for the one-dimensional Helmholtz equation in the case where the wave speed is piecewise constant. Scattering data recorded for an arbitrarily small interval of frequencies is shown to determine the…

Analysis of PDEs · Mathematics 2020-08-26 Sophia Bugarija , Peter C. Gibson , Guanghui Hu , Peijun Li , Yue Zhao

When solving the time-dependent radiative transport equation (RTE), implicit time discretization is often employed for its robustness and stability. This results in a sequence of steady-state RTEs with identical cross-sections but varying…

Numerical Analysis · Mathematics 2026-04-24 Qinchen Song , Lei Zhang , Min Tang

The plane wave method is most widely used for solving the Kohn-Sham equations in first-principles materials science computations. In this procedure, the three-dimensional (3-dim) trial wave functions' fast Fourier transform (FFT) is a…

Computational Physics · Physics 2018-01-17 Xingyu Gao , Zeyao Mo , Jun Fang , Han Wang

We introduce and analyze various Regularized Combined Field Integral Equations (CFIER) formulations of time-harmonic Navier equations in media with piece-wise constant material properties. These formulations can be derived systematically…

Numerical Analysis · Mathematics 2022-04-21 Victor Dominguez , Catalin Turc

This paper is devoted to the efficient numerical solution of the Helmholtz equation in a two- or three-dimensional rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is discretized by standard bilinear and…

Numerical Analysis · Computer Science 2019-10-24 Jari Toivanen , Monika Wolfmayr

Fast, high-order accurate algorithms for electromagnetic scattering from axisymmetric objects are of great importance when modeling physical phenomena in optics, materials science (e.g. meta-materials), and many other fields of applied…

Numerical Analysis · Mathematics 2019-05-22 Jun Lai , Michael O'Neil

The boundary integral method is an efficient approach for solving time-harmonic acoustic obstacle scattering problems. The main computational task is the evaluation of an oscillatory boundary integral at each discretization point of the…

Numerical Analysis · Mathematics 2014-09-17 Lexing Ying

This paper proposes a frequency/time hybrid integral-equation method for the time dependent wave equation in two and three-dimensional spatial domains. Relying on Fourier Transformation in time, the method utilizes a fixed…

Numerical Analysis · Mathematics 2020-04-30 Thomas G. Anderson , Oscar P. Bruno , Mark Lyon

Approximate methods to estimate solutions to the radiative transfer equation are essential for the understanding of atmospheres of exoplanets and brown dwarfs. The simplest and most popular choice is the "two-stream method" which is often…

Earth and Planetary Astrophysics · Physics 2023-04-12 Caoimhe M. Rooney , Natasha E. Batalha , Mark S. Marley

We study a symmetric BEM-FEM coupling scheme for the scattering of transient acoustic waves by bounded inhomogeneous anisotropic obstacles in a homogeneous field. An incident wave in free space interacts with the obstacles and produces a…

Numerical Analysis · Mathematics 2016-08-24 Matthew E. Hassell , Francisco-Javier Sayas

We propose a new discrete FFT-based method for computational homogenization of micromechanics on a regular grid that is simple, fast and robust. The discretization scheme is based on a tetrahedral stencil that displays three crucial…

Numerical Analysis · Mathematics 2024-05-21 Alphonse Finel

This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transform (NFT). The theoretical underpinnings of this generalization of the conventional…

Numerical Analysis · Mathematics 2018-07-24 Vishal Vaibhav

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

Numerical Analysis · Mathematics 2017-12-04 Nicholas Hale , Sheehan Olver

For problems of time-harmonic scattering by polygonal obstacles, embedding formulae provide a useful means of computing the far-field coefficient induced by any incident plane wave, given the far-field coefficient of a relatively small set…

Numerical Analysis · Mathematics 2018-05-24 Andrew Gibbs , Stephen Langdon , Andrea Moiola

We develop an efficient algorithm for a spatially inhomogeneous matrix-valued quantum Boltzmann equation derived from the Hubbard model. The distribution functions are $2 \times 2$ matrix-valued to accommodate the spin degree of freedom,…

Computational Physics · Physics 2015-05-15 Jianfeng Lu , Christian B. Mendl

The paper is concerned with the three-dimensional electromagnetic scattering from a large open rectangular cavity that is embedded in a perfectly electrically conducting infinite ground plane. By introducing a transparent boundary…

Numerical Analysis · Mathematics 2021-04-28 Yanli Chen , Xue Jiang , Jun Lai , Peijun Li

We present a fast spectral Galerkin scheme for the discretization of boundary integral equations arising from two-dimensional Helmholtz transmission problems in multi-layered periodic structures or gratings. Employing suitably parametrized…

Numerical Analysis · Mathematics 2020-11-06 José Pinto , Rubén Aylwin , Carlos Jerez-Hanckes

We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…

Numerical Analysis · Mathematics 2008-02-13 Lexing Ying , Sergey Fomel

The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…

Computational Complexity · Computer Science 2023-10-24 Songsong Li , Chaoping Xing