pith. sign in

arxiv: 1809.03808 · v3 · pith:ZPXUA5GOnew · submitted 2018-09-11 · 🧮 math.NA · cs.NA

A fast Fourier transform based direct solver for the Helmholtz problem

classification 🧮 math.NA cs.NA
keywords directfasthelmholtzsolverfouriernumericalproblemseparable
0
0 comments X
read the original abstract

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 trilinear finite elements on an orthogonal mesh yielding a separable system of linear equations. The main key to high performance is to employ the Fast Fourier transform (FFT) within a fast direct solver to solve the large separable systems. The computational complexity of the proposed FFT based direct solver is O(N log N) operations. Numerical results for both two- and three-dimensional problems are presented confirming the efficiency of the method discussed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.