Armin Shmilovici Leib

A recursive algorithm is described for computing the representation of functions with respect to a nonorthogonal and possibly overcomplete dictionary of elementary building blocks. This algorithm, which follows the Orthogonal Matching Pursuit algorithm, is used for the identification of fuzzy systems where the membership functions are the basic building blocks. The algorithm is demonstrated on the identification of the Glycolytic chaotic time series.