Nonlinear reduction of data

Abstract The problem of data reduction (sifting) of planar point series is approached from an information theoretical angle. It is concluded that effective data reduction can be achieved only when there exists a complementary relationship between the data reduction algorithm and the subsequent interpolation algorithm. A nonlinear data-reduction algorithm is described and examined. Some computational results demonstrate good agreement between the predicted and the actual behavior of the algorithm.