English
Related papers

Related papers: A fast Fourier transform based direct solver for t…

200 papers

In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…

Signal Processing · Electrical Eng. & Systems 2024-11-26 Yuxiao Wu , Huizhi Wang , Yong Zeng

In this paper we present an overview of recent progress on the development and analysis of domain decomposition preconditioners for discretised Helmholtz problems, where the preconditioner is constructed from the corresponding problem with…

Numerical Analysis · Mathematics 2016-06-24 I. G. Graham , E. A. Spence , E. Vainikko

This paper is concerned with the multi-frequency factorization method for imaging the support of a wave-number-dependent source function. It is supposed that the source function is given by the inverse Fourier transform of some…

Numerical Analysis · Mathematics 2024-01-02 Hongxia Guo , Guanghui Hu

The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…

Data Structures and Algorithms · Computer Science 2024-12-18 Saulo Queiroz , João P. Vilela , Edmundo Monteiro

We present an efficient procedure for computing resonances and resonant modes of Helmholtz problems posed in exterior domains. The problem is formulated as a nonlinear eigenvalue problem (NEP), where the nonlinearity arises from the use of…

Numerical Analysis · Mathematics 2016-07-01 Juan Carlos Araujo-Cabarcas , Christian Engstrom , Elias Jarlebring

We present the Fast Newton Transform (FNT), an algorithm for performing $m$-variate Newton interpolation in downward closed polynomial spaces with time complexity $\mathcal{O}(|A|m\overline{n})$. Here, $A$ is a downward closed set of…

Numerical Analysis · Mathematics 2025-12-25 Phil-Alexander Hofmann , Michael Hecht

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

Computational Physics · Physics 2017-12-13 Vishal Vaibhav

In the paper it is shown that there exist infinite classes of fast DFT algorithms having multiplicative complexity lower than O(NlogN), i.e. smaller than their arithmetical complexity. The derivation starts with nesting of Discrete Fourier…

Signal Processing · Electrical Eng. & Systems 2023-03-07 Ryszard Stasinski

Diffuse scattering is a rich source of information about disorder in crystalline materials, which can be modelled using atomistic techniques such as Monte Carlo and molecular dynamics simulations. Modern X-ray and neutron scattering…

Materials Science · Physics 2018-12-21 Joseph A. M. Paddison

The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN, whereas the geometrically more versatile finite…

Materials Science · Physics 2008-10-04 Evaggelos Kritsikis , Jean-Christophe Toussaint , Olivier Fruchart

The paper introduces the sweeping preconditioner, which is highly efficient for iterative solutions of the variable coefficient Helmholtz equation including very high frequency problems. The first central idea of this novel approach is to…

Numerical Analysis · Mathematics 2010-08-04 Björn Engquist , Lexing Ying

A nonlinear Helmholtz (NLH) equation with high frequencies and corner singularities is discretized by the linear finite element method (FEM). After deriving some wave-number-explicit stability estimates and the singularity decomposition for…

Numerical Analysis · Mathematics 2024-05-28 Run Jiang , Haijun Wu , Yifeng Xu , Jun Zou

In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…

Numerical Analysis · Mathematics 2015-07-28 Ken'ichiro Tanaka

The ability to resolve detail in the object that is being imaged, named by resolution, is the core parameter of an imaging system. Super-resolution is a class of techniques that can enhance the resolution of an imaging system and even…

Data Structures and Algorithms · Computer Science 2022-10-13 Yaonan Jin , Daogao Liu , Zhao Song

We present an approach for solving optimal Dirichlet boundary control problems of nonlinear optics by using deep learning. For computing high resolution approximations of the solution to the nonlinear wave model, we propose higher order…

Numerical Analysis · Mathematics 2023-12-27 Nils Margenberg , Franz X. Kärtner , Markus Bause

We present and analyze fully discrete Nystr\"om methods for the solution of three classes of well conditioned boundary integral equations for the solution of two dimensional scattering problems by homogeneous dielectric scatterers.…

Numerical Analysis · Mathematics 2014-04-07 Y. Boubendir , V. Dominguez , C. Turc

The displacement field for three dimensional dynamic elasticity problems in the frequency domain can be decomposed into a sum of a longitudinal and a transversal part known as a Helmholtz decomposition. The Cartesian components of both the…

Computational Physics · Physics 2019-10-02 Evert Klaseboer , Qiang Sun , Derek Y. C. Chan

In this paper, using the approximate particular solutions of Helmholtz equations, we solve the boundary value problems of Helmholtz equations by combining the methods of fundamental solutions (MFS) with the methods of particular solutions…

Numerical Analysis · Mathematics 2024-11-27 Adam Johnson

Consider the scattering of a time-harmonic plane wave by heterogeneous media consisting of linear or nonlinear point scatterers and extended obstacles. A generalized Foldy-Lax formulation is developed to take fully into account of the…

Numerical Analysis · Mathematics 2017-06-22 Jun Lai , Ming Li , Peijun Li , Wei Li

The fast Fourier transform (FFT) is a primitive kernel in numerous fields of science and engineering. OpenFFT is an open-source parallel package for 3-D FFTs, built on a communication-optimal domain decomposition method for achieving…

Mathematical Software · Computer Science 2015-08-27 Truong Vinh Truong Duy , Taisuke Ozaki
‹ Prev 1 8 9 10 Next ›