recursive def of legendre polynomial

• Subject: recursive def of legendre polynomial
• From: Edwin Woollett
• Date: Sun, 9 Aug 2009 12:12:13 -0700

Can I use either ordinary functions or hashed arrays
to define recursively the legendre polynomial p(n,x)
defined by

p (n,x) := ((2*n-1)/n)*x*p (n-1,x) - ((n-1)/n)*p (n-2,x),

p (0,x) : 1,
p (1,x) : x,

so I get, eg., p (2,x) -->  - 1/2 + 3*x^2/ 2  .

Thanks in advance,

Ted Woollett

• Prev by Date: Program stack overflow defining infix operator
• Next by Date: write_data - problem with brackets
• Previous by thread: Recurring build problem with maxima.info
• Next by thread: recursive def of legendre polynomial
• Index(es):
  • Date
  • Thread