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.

Chapter 5, PROBLEM SET 5.2 #14

This problem has been solved!


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 un, obtain the Bonnet recursion.

(n + 1)Pn+1(x) = (2n + 1)xP,(x) – npn-1(x),

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.

Related Book For answer-question

Advanced Engineering Mathematics

10th edition

Authors: Erwin Kreyszig

ISBN: 978-0470458365