On: “A propagating algorithm for determining nth‐order polynomial, least‐squares fits,” by A. F. Gangi and J. N. Shapiro (GEOPHYSICS, October 1977, p. 1265–1276).
Keyword(s):
The Mean
◽
Gangi and Shapiro (1977) proposed a recursive algorithm for determining coefficients of least‐squares polynomials. The algorithm is simpler and more efficient than Trench’s (1965) algorithm or Phillips’ (1971) triangular decomposition algorithm and has an advantage that by monitoring the mean‐square errors at each iteration we can find an optimum order of polynomial fit. We have tried their algorithm and encountered a difficulty. It may be worth recording the source of the difficulty.