Invariant Imbedding and the Solution of Fredholm Integral Equations with Displacement Kernels

Comparative Numerical Experiments

by M. A. Cali, J. L. Casti, M. L. Juncosa, David H. Greenberg, Albert J. Lipson, Bernard D. Rostker


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback11 pages $20.00 $16.00 20% Web Discount

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.

This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.