Particular features of implementation of an unsaturated numerical method for the exterior axisymmetric Neumann problem

Using Babenko's profound ideas, we construct a fundamentally new unsaturated numerical method for solving the spectral problem for the operator of the exterior axisymmetric Neumann problem for Laplace's equation. We estimate the deviation of the first eigenvalue of the discretized problem from the eigenvalue of the Neumann operator. More exactly, the unsaturated discretization of the spectral Neumann problem yields an algebraic problem with a good matrix, i.e., a matrix inheriting the spectral properties of the Neumann operator. Thus, its spectral portrait lacks “parasitic” eigenvalues provided that the discretization error is sufficiently small. The error estimate for the first eigenvalue involves efficiently computable parameters, which in the case of $C^\infty$-smooth data provides a foundation for a guaranteed success.