The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in an Euclidean space, sometimes leads to slow convergence of the constructed sequence. Such slow convergence depends both on the choice of the starting point and on the monotoneous behaviour of the usual algorithms. As there is normally no indication of how to choose the starting point in order to avoid slow convergence, we present in this paper a non-monotoneous parallel algorithm...

We present an integral equation method for solving boundary value problems of the Helmholtz equation in unbounded domains. The method relies on the factorisation of one of the Calderón projectors by an operator approximating the exterior admittance (Dirichlet to Neumann) operator of the scattering obstacle. We show how the pseudo-differential calculus allows us to construct such approximations and that this yields integral equations without internal resonances and being well-conditioned at all frequencies....

We present an integral equation method for solving boundary value problems of the Helmholtz equation in unbounded domains. The method relies on the factorisation of one of the Calderón projectors by an operator approximating the exterior admittance (Dirichlet to Neumann) operator of the scattering obstacle. We show how the pseudo-differential calculus allows us to construct such approximations and that this yields integral equations without internal resonances and being well-conditioned at all...