Answers are grounded in this paper and cite their sources.
The present paper describes an algorithm for rapid solution of boundary value problems for the Helmholtz equation in two dimensions based on iteratively solving integral equations of scattering theory. CPU time requirements of previously published algorithms of this type are of the order n2, where n is the number of nodes in the discretization of the boundary of the scatterer. The CPU time requirements of the algorithm of the present paper are n43, and can be further reduced, making it considerably more practical for large scale problems.
No takes yet. Share an insight, caveat, or question.
Vladimir Rokhlin (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: