On shooting methods for the discrete Helmholtz equation with constant coefficients (Q1326430)

The paper is concerned with shooting solvers for the Helmholtz equation with constant coefficients in two dimensions using finite differences for the discretization. Dirichlet boundary conditions are treated though other conditions are possible. Beginning with a single shooting method some recursive multiple shooting methods are developed. It is shown that the performance of the algorithms may be improved considerably by a redundance-free recursion. The number of operations required for one solution is computed, but without preparing some matrices which do not depend on the boundary conditions and the inhomogenity. For a square with \(n \times n\) points the number is of the order \(O(n^{2+\varepsilon (n)})\) with \(\varepsilon (n)=O(\log \log n/ \sqrt {\log n})\) \((n \to \infty)\). The method is compared with a multigrid program and finally -- as an example -- a Stokes-solver and some numerical results with the shooting method are given.