Recursive Binary Sequences of Differences
Robert M. Richman
Mount Saint Mary's College,
Emmitsburg, MD 21727-7799
Abstract
A subset of the Walsh functions is identified, its properties are explored, and algorithms are given that generate the functions. Each function is divided into 2n intervals and is indexed by the integer n. It is shown that the nth function can be used to generate an nth derivative and the importance of this is illustrated for solving a class of minimization problems.
