Recurrence relations
Researchers
Description
Many of the special functions of mathematics satisfy a linear
recurrence relation (e.g. hypergeometric functions).
Such a recurrence relation is especially suitable for calculating
these functions for successive values of a parameter.
In many cases however the wanted solution is dominated by other
solutions of the recurrence relation, and so forward computation of
the solution is not a stable process. Research in the department
concentrates on the development of algorithms for the stable evaluation
of non-dominant solutions of linear
recurrence relations and recurrence systems, and on the acceleration
of the convergence of existing algorithms.
