Scribd
Upload
57 views2 pages

Leg Bess

Legendre polynomials are solutions to Legendre's equation and are possible only if m = n(n+1), where n = 0, 1, 2, etc. They satisfy orthogonality and normalization properties. Bessel functions arise as solutions to Helmholtz's equation in cylindrical coordinates and have an infinite series representation. Fourier-Bessel series can be used to represent functions defined over a bounded domain in terms of Bessel functions, similar to Fourier series.

Uploaded by

Vibhanshu Verma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
57 views2 pages

Leg Bess

Legendre polynomials are solutions to Legendre's equation and are possible only if m = n(n+1), where n = 0, 1, 2, etc. They satisfy orthogonality and normalization properties. Bessel functions arise as solutions to Helmholtz's equation in cylindrical coordinates and have an infinite series representation. Fourier-Bessel series can be used to represent functions defined over a bounded domain in terms of Bessel functions, similar to Fourier series.

Uploaded by

Vibhanshu Verma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Legendre Polynomials

These are the everywhere regular solutions of Legendres Equation [(1 x2 )u ] + mu = 0 which are possible only if m = n(n + 1), n = 0, 1, 2, . . . . (2) (1)

If 2 u = 0 and u is regular at = 0, in spherical polar coordinates and with / = 0 then Bn An r n + n+1 Pn (cos ). (10) u(r, ) = r n=0

Bessel Functions
On solving Helmholtz Equation 2 u + u = 0 in two-dimensional cylindrical polar coordinates (r, ) using the separable form one is led to the equation for y (x) = R(r ) with x = r x2 y + xy + (x2 p2 )y = 0. (2) u = exp(ip )R(r ) (1)

We write the solution corresponding to n as Pn (x). It is a polynomial of degree n. If n is even/odd then the polynomial is even/odd. They are normalised such that Pn (1) = 1. They satisfy the orthogonality relation
1

Pn (x)Pm (x) dx = 0,
1

n = m.

(3)

and

This is Bessels equation of order p. A common case of interest is for solutions for u with in the range [0, 2 ) in which case we have p = n, n = 0, 1, 2, 3, . . . For general p we have the series solution

Pn (x)2 dx =
1

2 . 2n + 1

(4)

J p (x) =
j =0

Thus for suitable f (x) on [1, 1] we have the generalized Fourier series

x (1)j (j + 1)(j + p + 1) 2

2 j +p

(3)

f (x) =
0

an Pn (x),

an =

n+

1 2

f (x)Pn (x) dx
1

(5)

The polynomials have a generating function

with (z ) the Gamma function, extending the factorial function to non-integer argument and with n! = (n + 1). The second independent solution is Jp (x) if p is not an integer. However if p is an integer then as Jn = (1)n Jn , these solutions are linearly dependent 1 . To cover this case also a second linearly independent solution Yp (x) is taken. This is dened as Yp (x) = Jp cos p Jp (x) sin p (4)

G(x, t) =
0

tn Pn (x) = (1 2xt + t2 )1/2 .

(6)

They can also be represented using Rodrigues Formula Pn (x) = 1 dn 2 (x 1)n . n 2 n! dxn (7)

and the limit p n considered if p = n. (Note Yp is often written Np .) For small x 1 x p (p + 1) 2 Y0 (x) (2/ ) (ln(x/2) + + . . .) p (p) 2 Yp (x) x Jp (x) (5) (6) (7)

These can be used to derive many recursion relations between the Pn and their derivatives, Pn . These need not be learnt. Pn+1 Pn1 = (2n + 1)Pn (n + 1)Pn+1 = (2n + 1)xPn + nPn1 = 0 1 (8) (9)

1 This result is consistent with ((3) as (x) (1)m /m!(x + m) as x m for m = 0, 1, 2, . . .. Thus the rst m terms in the series are zero if p = m.

For large x all these solutions behave like a damped sinusoidal function with y (x) A sin(x + )/ x. All the solutions have an innite number of zeros. The zeros of Jn are denoted jnm so that Jn (jnm ) = 0 and 0 < jn1 < jn2 < jn3 < . . .. jn1 jn2 jn3 jn4 jn5 2.4048 5.5201 8.6537 11.7915 14.9309 3.8317 7.0156 10.173 13.323 16.471 5.1356 8.4172 11.6198 14.796 17.960 . . . . . . . . . . . . . . .

If satises c2 2 = tt we may look for solutions of the type = u(r, ) exp(it), or equivalently (r, , t) =

uc (r, ) cos t + us (r, ) sin t.

(15)

n=0 n=1 n=2 . . .

with the arbitrary constants multiplying uc and us absorbed into their denition. In either case uc,s satises 2 u + u = 0, with = 2 /c2 taking unknown values to be determined as eigenvalues. The spatial part of the solution u(r, ) has the solution u(r, ) =
p,

exp(ip ) A p Jp ( r ) + Bp Yp ( r ) .

(16)

If pl and ql are such that Jn (pl) = Jn (ql) = 0 then


l

xJn (px)Jn (qx) dx = 0


0 l

(8) (9)

xJn (px)2 dx =
0

l2 l2 J (pl)2 = Jn1 (pl)2 . 2 n 2

The values of p will be determined by the geometry and boundary conditions in the -direction. The values of (and hence ) by the geometry and boundary conditions in r . For example if 0 < 2 ) with the solutions periodic in then p = n = 0, 1, 2, 3, . . .. If 0 r a with u nite at r = 0 and u = 0 on r = a then = jnm /a, with m = 0, 1, 2, . . .. Thus

(Similar equations are valid for other suitable ranges of integration.) See (13) below for the last equality. This leads to Fourier-Bessel Series. If f (x) is a function dened on x = [0, l] then, for any n we may write

u(r, ) =
m=1

A0m J0 (j0m r/a) +


n=1 m=1

(Anm cos n + Bnm sin n )Jn (jnm r/a). (17)

f (x) =
m=1 2 2

Am Jn (jnm x/l)

(10)

l l Jn1 (jnm ) = xf (x)Jn (jnm x/l) dx. 2 0 There is a generating function for the Bessel functions of integer order.

Am

(11)

The sum over possible values of in (15), i.e. over the eigenvalues has become the double sum over n and m in (17). The constants An , Bn may be found, for example, from the initial distribution of uc and us at t = 0 when or t may be given. We need to represent their dependence as a Fourier series in and their radial dependence in a Fourier-Bessel series in r .

G(x, t) = exp

x 2

1 t

n=

=
n=

tn Jn (x)

(12)

and using this, or the series denition of Jn (x) (which is valid even if n is not an integer) one may show, for example n Jn (x) Jn (x), z 2n Jn (x). Jn1 (x) + Jn+1 (x) = x Jn1 (x) = 3 (13) (14) 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy