Computations of 3D problems of high complexity with GMT

It is demonstrated that the GMT (generalized multipole technique) is a promising method for computing a wide range of highly complex 2D and 3D problems with high accuracy. Some aspects of the simulation techniques and the present capabilities of MMP (multiple multipole) programs are discussed. Particular attention is given to discretization of the problem, choice of the locations of the multipoles, and sources. It is noted that, in order to easily achieve good performance, a powerful graphic input editor is necessary, and that the MMP program package already includes an excellent 2D input editor.<>