A new algorithm for fast searching hole points, fringe points, interpolation elements and interpolation coefficients utilized in overlapping grid systems is presented. A fast searching algorithm is required in overlapped grid system since it can occur to pay much time to search hole points, fringe points and interpolation elements.
Present algorithm searches fringe points prior to searching hole points in contrast with other algorithms, so fringe points have a sequence and it is not necessary to search hole points. The sequence of fringe points makes it possible to search donor elements fast since it can use the donor element of the prior frige point for the initial guess of the donor element of the present fringe point.
Present algorithm connects the fringe point of current step with the fringe point of previous step in case of relatively moving body problems. So, present algorithm for moving body problems is much faster than that of steady problems since it can use the donor element of the fringe point of previous step for the initial guess of the donor element of the fringe point of current step.
Application problems of the present searching algorithm are presented for various 2-D and 3-D overlapped grid systems.
