A fourth-order-accurate Fourier method for the Helmholtz equation in three dimensions
ACM Transactions on Mathematical Software (TOMS)
Algorithm 651: Algorithm HFFT–high-order fast-direct solution of the Helmholtz equation
ACM Transactions on Mathematical Software (TOMS)
A Fast Domain Decomposition High Order Poisson Solver
Journal of Scientific Computing
Orthogonal spline collocation methods for partial differential equations
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. VII: partial differential equations
Optimal Superconvergent One Step Nodal Cubic Spline Collocation Methods
SIAM Journal on Scientific Computing
Compact finite difference schemes of sixth order for the Helmholtz equation
Journal of Computational and Applied Mathematics
Modified Nodal Cubic Spline Collocation For Poisson's Equation
SIAM Journal on Numerical Analysis
Journal of Computational Physics
A Compact Fourth Order Scheme for the Helmholtz Equation in Polar Coordinates
Journal of Scientific Computing
Matrix decomposition algorithms for elliptic boundary value problems: a survey
Numerical Algorithms
Compact schemes for acoustics in the frequency domain
Mathematical and Computer Modelling: An International Journal
A composite preconditioner for the electromagnetic scattering from a large cavity
Journal of Computational Physics
A new preconditioner for the interface system arising in a fast Helmholtz solver
Computers & Mathematics with Applications
Journal of Computational Physics
Hi-index | 31.46 |
Quadratic spline collocation methods are formulated for the numerical solution of the Helmholtz equation in the unit square subject to non-homogeneous Dirichlet, Neumann and mixed boundary conditions, and also periodic boundary conditions. The methods are constructed so that they are: (a) of optimal accuracy, and (b) compact; that is, the collocation equations can be solved using a matrix decomposition algorithm involving only tridiagonal linear systems. Using fast Fourier transforms, the computational cost of such an algorithm is O(N^2logN) on an NxN uniform partition of the unit square. The results of numerical experiments demonstrate the optimal global accuracy of the methods as well as superconvergence phenomena. In particular, it is shown that the methods are fourth-order accurate at the nodes of the partition.