ISSN:
1573-7691
Keywords:
Bratu's problem
;
nonlinear eigenvalue problem
;
spectral methods
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract Bratu's problem, which is the nonlinear eigenvalue equationΔu+λ exp(u)=0 withu=0 on the walls of the unit square andλ as the eigenvalue, is used to develop several themes on applications of Chebyshev pseudospectral methods. The first is the importance ofsymmetry: because of invariance under the C4 rotation group and parity in bothx andy, one can slash the size of the basis set by a factor of eight and reduce the CPU time by three orders of magnitude. Second, the pseudospectral method is ananalytical as well as a numerical tool: the simple approximationλ≈3.2A exp(−0.64A), whereA is the maximum value ofu(x, y), is derived via collocation with but a single interpolation point, but is quantitatively accurate for small and moderateA. Third, the Newton-Kantorovich/Chebyshev pseudospectral algorithm is so efficient that it is possible to compute good numerical solutions—five decimal places—on amicrocomputer inbasic. Fourth, asymptotic estimates of the Chebyshev coefficients can be very misleading: the coefficients for moderately or strongly nonlinear solutions to Bratu's equations fall off exponentially rather than algebraically withv untilv is so large that one has already obtained several decimal places of accuracy. The corner singularities, which dominate the behavior of the Chebyshev coefficients in thelimit v→∞, are so weak as to be irrelevant, and replacing Bratu's problem by a more complicated and realistic equation would merely exaggerate the unimportance of the corner branch points even more.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01061392
Permalink
