Chapter 5, PROBLEM SET 5.2 #14

Do you need an answer to a question different from the above? Ask your question!

Differentiating (13) with respect to u, using (13) in the resulting formula, and comparing coefficients of u^{n}, obtain the Bonnet recursion.

where n = 1, 2, . . . . This formula is useful for computations, the loss of significant digits being small (except near zeros). Try (14) out for a few computations of your own choice.

PROBLEM SET 5.2:

PROBLEM SET 5.3:

PROBLEM SET 5.4:

PROBLEM SET 5.5: