Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T07:09:47.908Z Has data issue: false hasContentIssue false

Chebyshev Spectral Methods and the Lane-Emden Problem

Published online by Cambridge University Press:  28 May 2015

John P. Boyd*
Affiliation:
Department of Atmospheric, Oceanic and Space Science, University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI 48109-2143, USA
*
*Corresponding author.Email address:jpboyd@umich.edu
Get access

Abstract

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

Information

Type
Research Article
Copyright
Copyright © Global Science Press Limited 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable