Invariant Imbedding and the Solution of Fredholm Integral Equations with Displacement Kernels
Comparative Numerical Experiments
Compares the relative efficiencies of the invariant imbedding method with the traditional solution techniques of successive approximations (Picard method), linear algebraic equations, and Sokolov’s method of averaging functional corrections in solving numerically two representatives of a class of Fredholm integral equations. The criterion of efficiency is the amount of computing time necessary to obtain the solution to a specified degree of accuracy. The results of this computational investigation indicate that invariant imbedding has definite numerical advantages; more information was obtained in the same, or even shorter, length of time than in the other methods. The conclusion emphasized is that a routine application of invariant imbedding may be expected to be computationally competitive with, if not superior to, a routine application of other methods for the solution of many classes of Fredholm integral equations.