Frobenius method (source code)

= Frobenius method
{c}
{wiki}

Near a regular singular point $x_0$, the Frobenius method seeks
$$
y=(x-x_0)^r\sum_{n\geq0}a_n(x-x_0)^n.
$$
The lowest power gives the indicial equation for $r$, and the remaining powers give a coefficient recurrence.