Algorithm 651: Algorithm HFFT–high-order fast-direct solution of the Helmholtz equation

Authors:
Ronald F. Boisvert
Affiliations:
National Bureau of Standards, Scientific Computing Division, Tech A151, Gaithersburg, MD
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1987

Citing 4
Cited 3

Solving elliptic problems using ELLPACK

Solving elliptic problems using ELLPACK
A fourth-order-accurate Fourier method for the Helmholtz equation in three dimensions

ACM Transactions on Mathematical Software (TOMS)
Algorithm 528: Framework for a Portable Library [Z]

ACM Transactions on Mathematical Software (TOMS)
High-Order Fast Elliptic Equation Solvers

ACM Transactions on Mathematical Software (TOMS)

Matrix decomposition algorithms for elliptic boundary value problems: a survey

Numerical Algorithms
Compact optimal quadratic spline collocation methods for the Helmholtz equation

Journal of Computational Physics
Modified nodal cubic spline collocation for three-dimensional variable coefficient second order partial differential equations

Numerical Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

HFFT is a software package for solving the Helmholtz equation on bounded two- and three-dimensional rectangular domains with Dirichlet, Neumann, or periodic boundary conditions. The software is the result of combining new fourth-order accurate compact finite difference (HODIE) discretizations and a fast-direct solution technique (the Fourier method). In this paper we briefly describe the user interface to HFFT and present an example of its usage and several details of its implementation.