Asymptotic Coefficients and Errors for Chebyshev Polynomial Approximations with Weak Endpoint Singularities: Effects of Different Bases
share
When solving differential equations by a spectral method, it is often convenient to shift from Chebyshev polynomials T_n(x) with coefficients a_n to modified basis functions that incorporate the boundary conditions. For homogeneous Dirichlet boundary conditions, u(± 1)=0, popular choices include the “Chebyshev difference basis", ς_n(x) ≡ T_n+2(x) - T_n(x) with coefficients here denoted b_n and the “quadratic-factor basis functions" ϱ_n(x) ≡ (1-x^2) T_n(x) with coefficients c_n. If u(x) is weakly singular at the boundaries, then a_n will decrease proportionally to 1/n^κ for some positive constant κ. We prove that the Chebyshev difference coefficients b_n decrease more slowly by a factor of n while the quadratic-factor coefficients c_n decrease more slowly still as 1/n^κ-2. The error for the unconstrained Chebyshev series, truncated at degree n=N, is O(1/N^κ) in the interior, but is worse by one power of N in narrow boundary layers near each of the endpoints. (For functions which are analytic over the whole domain including x=± 1, the Chebyshev series is much more uniform on x ∈ [-1, 1] <cit.>, but the analytic-at-the-endpoints functions are not discussed here.) Although the error norms are about the same, the error in the Chebyshev basis is concentrated in boundary layers near both endpoints whereas the error in the quadratic-factor and difference basis sets are nearly uniform oscillations over the entire interval in x. The value of the derivatives at the endpoints is O(N^2) for Chebyshev polynomials and for the quadratic-factor basis, but only O(N) for the difference basis. In spite of these differences, there is not a compelling reason to prefer one basis over another.
READ FULL TEXT
