Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

What Ended the Great Depression? Re-Evaluating the Role of Fiscal Policy

Conventional wisdom contends that fiscal policy was of secondary importance for the economic recovery in the 1930s. The recovery is then connected to monetary policy that allowed non-sterilised gold inflows to increase the money supply. Often this is shown by measuring the fiscal multipliers and demonstrating that they were relatively small. This paper shows that problems with the conventional measures of fiscal multipliers in the 1930s may have created an incorrect consensus on the irrelevance of fiscal policy. The rehabilitation of fiscal policy is seen as a necessary step in the reinterpretation of the positive role of New Deal policies for the recovery.