An iterative process is formulated on subdomains for odd P 2N +i-approximation in a bounded domain K c jR 3 conditionally decomposed into a finite set of subdomains. The convergence of the iterative algorithm is proved. This paper is a logical sequel to [2] where a similar problem was solved for a large class of boundary value problems with a monoenergetic integro-differential transport operator.Let V c £ 3 be a bounded domain in which we seek for the solution to a boundary value problem in P 2 N+i approximation [3], conditionally decomposed into a finite number of subdomains K v , v = 1,2,..., v 0 . The iterative algorithm suggested although somewhat similar to the Schwartz subdomain alternating method differs from the latter first of all in the fact that the domains V v are adjacent without overlapping. In our algorithm (in the Schwartz algorithm as well) it is possible in principle to reduce the problem in a geometrically complex domain V to the subsequent solution of problems in geometrically simplified subdomains V v .The paper is generally aimed at proving the convergence of the iterative process on the basis of the generalized solution concept.