Indexed metadata

Chebyshev Spectral Methods and the Lane-Emden Problem

John P. Boyd

Source record

Source: Crossref

Published: Apr 1, 2011

DOI: 10.4208/nmtma.2011.42s.2

Open original source ↗

Source abstract

The three-dimensional spherical polytropic Lane-Emden problem is yrr+(2/r)yr+ym=0,y(0)=1,yr(0)=0y_{rr}+(2/r) y_{r} + y^{m}=0, y(0)=1, y_{r}(0)=0 where m[0,5]m \in [0, 5] is a constant parameter. The domain is r[0,ξ]r \in [0, \xi] where ξ\xi is the first root of y(r)y(r). We recast this as a nonlinear eigenproblem, with three boundary conditions and ξ\xi as the eigenvalue allowing imposition of the extra boundary condition, by making the change of coordinate xr/ξx \equiv r/\xi: yxx+(2/x)yx+ξ2ym=0,y(0)=1,yx(0)=0,y_{xx}+(2/x) y_{x}+ \xi^{2} y^{m}=0, y(0)=1, y_{x}(0)=0, y(1)=0y(1)=0. We find that a Newton-Kantorovich iteration always converges from an mm-independent starting point y(0)(x)=cos([π/2]x),ξ(0)=3y^{(0)}(x)=\cos([\pi/2] x), \xi^{(0)}=3. We apply a Chebyshev pseudospectral method to discretize xx. The Lane-Emden equation has branch point singularities at the endpoint x=1x=1 whenever mm is not an integer; we show that the Chebyshev coefficients are anconstant/n2m+5a_{n} \sim constant/n^{2m+5} as nn \rightarrow \infty. However, a Chebyshev truncation of N=100N=100 always gives at least ten decimal places of accuracy — much more accuracy when mm is an integer. The numerical algorithm is so simple that the complete code (in Maple) is given as a one page table.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Chebyshev Spectral Methods and the Lane-Emden Problem — Mathematical Frontier Network