Recurrence relations and fast algorithms
Faster algorithms are constructed for evaluating transforms associated with families of functions which satisfy recurrence relations. The algorithms are efficient in the sense that their computation costs are proportional to \(n\ln n\) at any fixed precision of computations, where \(n\) is the amount of input and output data.
scientific article; zbMATH DE number 5648449