On the Chebyshev-tau approximation for some singularly perturbed two point boundary value problems – Numerical experiments

Abstract

In this paper we are concerned with numerical stability of Chebyshev-tau method in solving some singularly perturbed two-point boundary value problems.

We consider linear as well as nonlinear (convection-dominated flow) problems. In order to avoid the lack of numerical stability of this method we try a smoothing technique as well as a domain decomposition for linear problems.

Some successful numerical experiments are carried out.

Authors

C.I. Gheorghiu
Tiberiu Popoviciu Institute of Numerical Analysis
S.I. Pop
Babeș-Bolyai University, Faculty of Mathematics

Keywords

Chebyshev-tau; stability; two-point boundary value problem; singularly perturbed; steady state Burger; smoothing;

References

See the expanding block below.

Cite this paper as

C. I. Gheorghiu, S.I. Pop, On the Chebyshev-tau approximation for some singularly perturbed two point boundary value problems – Numerical experiments, Rev. Anal. Numér. Théor. Approx. 24 (1995) 117-124.

PDF

About this paper

Journal

Rev. Anal. Numér. Théor. Approx.

Publisher Name

Editions de l’Academie Roumaine

Print ISSN

1222-9024

Online ISSN

2457-8126

MR

?

ZBL

?

Google Scholar

?

[1] C. Canuto, M.Y. Hussaini, A. Quarteroni, T.A., Zang, Spectral Methods in Fluid Dynamics, Springer-Verlag, Springer Series in Computational Physics, 1988.

[2] C. I. Gheorghiu, On a Linear Singularity Perturbed TPBVP, Univ. of Cluj-Napoca, Seminar of Functional Analysis and Numerical Methods, Preprint 1 (1988), pp. 67-74.

[3] D. Gottlieb, S.A. Orszag, Numerical analysis of Spectral Methods: Theory and Applications, SIAM Philadelphia, 1977.

[4] C. Johson, Numerical solutions of p.d.e. by the f.e.m., Cambridge Univ. Press. 1987.

[5] R. B. Kellog, A. Tsan, analysis of some difference approximations for a singular perturbaiton problem without turning points, Math. Comput. 32, pp. 1025-1039 (1978).

[6] Y. Maday, A. Quarteroni, Legendre and Chebyshev Spectral Approixmation of Burgers’ Equation, Numer. Math. 37, pp. 321-332 (1981).

[7] S.A. Orszag, Accurate Solution of the Orr-Sommerfeld stability equation, J. Fluid Mech., 50, pp. 689-703 (1971).

[8] M. Stynes, E. O’Riordan, An analysis of a t.p.b.c.p. with a boundary layer, using only finite element techniques, Univ. College Cork. Ireland, 1989.

Paper (preprint) in HTML form

jnaat,+Journal+manager,+1995-Gheorghiu-Pop

ON THE CHEBYSHEV-TAU APPROXIMATION FOR SOME SINGULARLY PERTURBED TWO-POINT BOUNDARY VALUE PROBLEMS - NUMERICAL EXPERIMENTS

C.I. GHEORGHIU and S.I. POP(Cluj-Napoca)

1. INTRODUCTION

We try to expound a direct investigation on the stability of the Chebyshevtau approximation for a singularly perturbed linear two-point boundary value problem (t.p.b.v.p.)
(1.1) { ε u + u = 0 , x ( 1 , 1 ) , 0 < ε 1 u ( 1 ) = 1 , u ( 1 ) = 0 (1.1) ε u + u = 0 , x ( 1 , 1 ) , 0 < ε 1 u ( 1 ) = 1 , u ( 1 ) = 0 {:(1.1){[-epsiu^('')+u^(')=0","x in(-1","1)","0 < epsi≪1],[u(-1)=1","u(1)=0]:}:}\left\{\begin{array}{l} -\varepsilon u^{\prime \prime}+u^{\prime}=0, x \in(-1,1), 0<\varepsilon \ll 1 \tag{1.1}\\ u(-1)=1, u(1)=0 \end{array}\right.(1.1){εu+u=0,x(1,1),0<ε1u(1)=1,u(1)=0
as well as for a non-linear problem
(1.2) { ε u + u u = f ( x ) , x ( 1 , 1 ) , 0 < ε 1 u ( 1 ) = u ( 1 ) = 0 (1.2) ε u + u u = f ( x ) , x ( 1 , 1 ) , 0 < ε 1 u ( 1 ) = u ( 1 ) = 0 {:(1.2){[-epsiu^('')+uu^(')=f(x)","x in(-1","1)","0 < epsi≪1],[u(-1)=u(1)=0]:}:}\left\{\begin{array}{l} -\varepsilon u^{\prime \prime}+u u^{\prime}=f(x), x \in(-1,1), 0<\varepsilon \ll 1 \tag{1.2}\\ u(-1)=u(1)=0 \end{array}\right.(1.2){εu+uu=f(x),x(1,1),0<ε1u(1)=u(1)=0
Problem (1.1) may be regarded as a linearized one-dimensional version of a convection-dominated flow problem and problem (1.2) is the steady state Burgers' problem.
It is explained in [7] why expansions in Chebyshev polynomials are better suited to the solution of some singularly perturbed problems (particularly stability) of hydrodynamics, than expansions in other, seemingly more reievant, sets of orthogonal functions.
For improving the numerical stability, the tau variant of spectral methods leads to the determination of the coefficients corresponding to "high frequencies" (i.e high n n nnn in (2.1)) rather from the exact equations furnished by boundary conditions than from approximate algebraic system obtained from differential equation (see (2.2), (2.6), and (2.7)). It is well known that these "high frequencies" are responsible for the lack of stability.
In [6] the authors give the following error estimate for both Legendre and Chebyshev spectral approximation of (1.2)
(1.3) u N ( ε ) u ( ε ) 1 , ω + N u N ( ε ) u ( ε ) 0 , ω C ( ε ) N 1 σ , (1.3) u N ( ε ) u ( ε ) 1 , ω + N u N ( ε ) u ( ε ) 0 , ω C ( ε ) N 1 σ , {:(1.3)||u_(N)(epsi)-u(epsi)||_(1,omega)+N||u_(N)(epsi)-u(epsi)||_(0,omega) <= C(epsi)N^(1-sigma)",":}\begin{equation*} \left\|u_{N}(\varepsilon)-u(\varepsilon)\right\|_{1, \omega}+N\left\|u_{N}(\varepsilon)-u(\varepsilon)\right\|_{0, \omega} \leq C(\varepsilon) N^{1-\sigma}, \tag{1.3} \end{equation*}(1.3)uN(ε)u(ε)1,ω+NuN(ε)u(ε)0,ωC(ε)N1σ,
where u N ( x , ε ) u N ( x , ε ) u_(N)(x,epsi)u_{N}(x, \varepsilon)uN(x,ε) is the spectral approximation of the exact solution u ( x , ε ) , σ 1 u ( x , ε ) , σ 1 u(x,epsi),sigma >= 1u(x, \varepsilon), \sigma \geq 1u(x,ε),σ1, u ( x , ε ) H ω σ ( 1 , 1 ) , ε ( 0 , 1 ) , H ω σ u ( x , ε ) H ω σ ( 1 , 1 ) , ε ( 0 , 1 ) , H ω σ u(x,epsi)inH_(omega)^(sigma)(-1,1),quad AA epsi in(0,1),H_(omega)^(sigma)u(x, \varepsilon) \in H_{\omega}^{\sigma}(-1,1), \quad \forall \varepsilon \in(0,1), H_{\omega}^{\sigma}u(x,ε)Hωσ(1,1),ε(0,1),Hωσ are weighted Sobolev spaces for both Legendre and Chebyshev weights ( ω 1 , ω = ( 1 x 2 ) 1 / 2 ω 1 , ω = 1 x 2 1 / 2 (omega-=1,omega=(1-x^(2))^(-1//2):}\left(\omega \equiv 1, \omega=\left(1-x^{2}\right)^{-1 / 2}\right.(ω1,ω=(1x2)1/2 respectively ) ) ))) and σ , ω σ , ω ||*||_(sigma,omega)\|\cdot\|_{\sigma, \omega}σ,ω stands for the norm in H ω σ H ω σ H_(omega)^(sigma)H_{\omega}^{\sigma}Hωσ.
Actually (1.3) comes from
(1.4) u N ( ε ) u ( ε ) 1 , ω C N 1 σ u ( ε ) σ , ω (1.4) u N ( ε ) u ( ε ) 1 , ω C N 1 σ u ( ε ) σ , ω {:(1.4)||u_(N)(epsi)-u(epsi)||_(1,omega) <= CN^(1-sigma)||u(epsi)||_(sigma,omega):}\begin{equation*} \left\|u_{N}(\varepsilon)-u(\varepsilon)\right\|_{1, \omega} \leq C N^{1-\sigma}\|u(\varepsilon)\|_{\sigma, \omega} \tag{1.4} \end{equation*}(1.4)uN(ε)u(ε)1,ωCN1σu(ε)σ,ω
and
(1.5) u ( ε ) u N ( ε ) L ω 2 ( 0 , 1 ) C N σ u ( ε ) σ , ω (1.5) u ( ε ) u N ( ε ) L ω 2 ( 0 , 1 ) C N σ u ( ε ) σ , ω {:(1.5)||u(epsi)-u_(N)(epsi)||_(L_(omega)^(2)(0,1)) <= CN^(-sigma)||u(epsi)||_(sigma,omega):}\begin{equation*} \left\|u(\varepsilon)-u_{N}(\varepsilon)\right\|_{L_{\omega}^{2}(0,1)} \leq C N^{-\sigma}\|u(\varepsilon)\|_{\sigma, \omega} \tag{1.5} \end{equation*}(1.5)u(ε)uN(ε)Lω2(0,1)CNσu(ε)σ,ω
Of course, estimations (1.3), (1.4) and (1.5) are also valid for (1.1).
Throughout this paper C C CCC will denote a generic positive constant independent of N N NNN.
Unfortunately, in [5] the authors give bounds for derivatives coresponding to (1.1) that make estimations (1.4) and (1.5), and of course (1.3), useless.
They read as follows
| u ( i ) ( x , ε ) | C ( 1 + ε i e ( x 1 ) / ε ) ) , 1 < x < 1 , i = 1 , 2 u ( i ) ( x , ε ) C 1 + ε i e ( x 1 ) / ε ) , 1 < x < 1 , i = 1 , 2 |u^((i))(x,epsi)| <= C(1+epsi^(-i)e^((x-1)//epsi))),-1 < x < 1,i=1,2\left|u^{(i)}(x, \varepsilon)\right| \leq C\left(1+\varepsilon^{-i} e^{(x-1) / \varepsilon)}\right),-1<x<1, i=1,2|u(i)(x,ε)|C(1+εie(x1)/ε)),1<x<1,i=1,2
and they show the main difficulty in treating singularly perturbed t.p.b.v.p. of boundary layer type. Many numerical methods (finite difference and finite elements) proposed to solve (1.1) or (1.2), are expouned in [4], [5] and [8].
In order to avoid the lack of stability for almost all numerical methods used in such boundary layer type problems we try a smoothing technique suggested in [1] as well as, for linear problems (1.1), a domain decomposition method also available, for example, in [1], ch. 13.

2. THE CHEBYSHEV-TAU FORMULATION

The Chebyshev approximation u N ( x , ε ) u N ( x , ε ) u_(N)(x,epsi)u_{N}(x, \varepsilon)uN(x,ε) of the exact solution of (1.1) is given by
(2.1) u N ( x , ε ) = n = 0 N a n T n ( x ) where a i are unknown real (2.1) u N ( x , ε ) = n = 0 N a n T n ( x )  where  a i  are unknown real  {:(2.1)u_(N)(x","epsi)=sum_(n=0)^(N)a_(n)T_(n)(x)quad" where "a_(i)" are unknown real ":}\begin{equation*} u_{N}(x, \varepsilon)=\sum_{n=0}^{N} a_{n} T_{n}(x) \quad \text { where } a_{i} \text { are unknown real } \tag{2.1} \end{equation*}(2.1)uN(x,ε)=n=0NanTn(x) where ai are unknown real 
coefficients depending on ε ε epsi\varepsilonε and T i ( x ) , i = 1 , 2 , , n T i ( x ) , i = 1 , 2 , , n T_(i)(x),i=1,2,dots,nT_{i}(x), i=1,2, \ldots, nTi(x),i=1,2,,n are Chebyshev polynomials of the first kind. Using (2.1) and the appendix from [3], the Chebyshev-tau approximation for (1.1) reads as follows
(2.2) { ε c n p = n + 2 N p ( p 2 n 2 ) a p + 1 c n p = n + 1 N p a p = 0 , 0 n N 2 p + n even n = 0 N ( 1 ) n a n = 1 , n = 0 N a n = 0 , (2.2) ε c n p = n + 2 N p p 2 n 2 a p + 1 c n p = n + 1 N p a p = 0 , 0 n N 2 p + n  even  n = 0 N ( 1 ) n a n = 1 , n = 0 N a n = 0 , {:(2.2){[-(epsi)/(c_(n))sum_(p=n+2)^(N)p(p^(2)-n^(2))a_(p)+(1)/(c_(n))sum_(p=n+1)^(N)pa_(p)=0","0 <= n <= N-2],[quad p+n" even "],[sum_(n=0)^(N)(-1)^(n)a_(n)=1","sum_(n=0)^(N)a_(n)=0","]:}:}\left\{\begin{array}{l} -\frac{\varepsilon}{c_{n}} \sum_{p=n+2}^{N} p\left(p^{2}-n^{2}\right) a_{p}+\frac{1}{c_{n}} \sum_{p=n+1}^{N} p a_{p}=0,0 \leq n \leq N-2 \tag{2.2}\\ \quad p+n \text { even } \\ \sum_{n=0}^{N}(-1)^{n} a_{n}=1, \sum_{n=0}^{N} a_{n}=0, \end{array}\right.(2.2){εcnp=n+2Np(p2n2)ap+1cnp=n+1Npap=0,0nN2p+n even n=0N(1)nan=1,n=0Nan=0,
The smoothing of (2.1) means to consider instead of that the expansion
(2.3) u N ( x , ε ) = n = 0 N a n σ n T n ( x ) (2.3) u N ( x , ε ) = n = 0 N a n σ n T n ( x ) {:(2.3)u_(N)(x","epsi)=sum_(n=0)^(N)a_(n)sigma_(n)T_(n)(x):}\begin{equation*} u_{N}(x, \varepsilon)=\sum_{n=0}^{N} a_{n} \sigma_{n} T_{n}(x) \tag{2.3} \end{equation*}(2.3)uN(x,ε)=n=0NanσnTn(x)
where the σ n σ n sigma_(n)\sigma_{n}σn are required to be real non-negative numbers such that σ 0 = 1 σ 0 = 1 sigma_(0)=1\sigma_{0}=1σ0=1 and σ n σ n sigma_(n)\sigma_{n}σn are decreasing function of n n nnn. We used the factor σ n σ n sigma_(n)\sigma_{n}σn corresponding to the raised cosine smoothing, i.e.
c n = 1 2 ( 1 + cos n π N ) , n = 0 , 1 , , N c n = 1 2 1 + cos n π N , n = 0 , 1 , , N c_(n)=(1)/(2)(1+cos((n pi)/(N))),n=0,1,dots,Nc_{n}=\frac{1}{2}\left(1+\cos \frac{n \pi}{N}\right), n=0,1, \ldots, Ncn=12(1+cosnπN),n=0,1,,N
The qualitative study of problem (1.1), for example [2], [4], enables us to decompose the domain ( 1 , 1 1 , 1 -1,1-1,11,1 ) into separate subdomains Ω 1 Ω 1 Omega_(1)\Omega_{1}Ω1 and Ω 2 Ω 2 Omega_(2)\Omega_{2}Ω2 such that ( 1 , 1 ) = Ω 1 Ω 2 , Ω 1 Ω 2 = ( 1 , 1 ) = Ω 1 Ω 2 , Ω 1 Ω 2 = (-1,1)=Omega_(1)uuOmega_(2),Omega_(1)nnOmega_(2)=O/(-1,1)=\Omega_{1} \cup \Omega_{2}, \Omega_{1} \cap \Omega_{2}=\varnothing(1,1)=Ω1Ω2,Ω1Ω2= and Ω 1 = ( 1 , 1 m ε ] [ 1 m ε , 1 ] Ω 1 = ( 1 , 1 m ε ] [ 1 m ε , 1 ] Omega_(1)=(-1,1-m epsi]uu[1-m epsi,1]\Omega_{1}=(-1,1-m \varepsilon] \cup[1-m \varepsilon, 1]Ω1=(1,1mε][1mε,1], where m m mmm was taken between 5 and 15 . The domain Ω 2 Ω 2 Omega_(2)\Omega_{2}Ω2 is the domain of boundary layer (a strip of width O ( ε ) O ( ε ) O(epsi)O(\varepsilon)O(ε) ) displayed on the left of x = 1 x = 1 x=1x=1x=1.
We choose from a large variety of domain decomposition method the patching method (see [1], p. 470). So, the patched Chebyshev-tau approximation u N ( x ) u N ( x ) u_(N)(x)u_{N}(x)uN(x) of solution of (1.1) is
where
u N ( x , ε ) = { u 1 N 1 ( x , ε ) , x Ω 1 u 2 N 2 ( x , ε ) , x Ω 2 u N ( x , ε ) = u 1 N 1 ( x , ε ) , x Ω 1 u 2 N 2 ( x , ε ) , x Ω 2 u_(N)(x,epsi)={[u_(1)^(N_(1))(x","epsi)","x inOmega_(1)],[u_(2)^(N_(2))(x","epsi)","x inOmega_(2)]:}u_{N}(x, \varepsilon)=\left\{\begin{array}{l} u_{1}^{N_{1}}(x, \varepsilon), x \in \Omega_{1} \\ u_{2}^{N_{2}}(x, \varepsilon), x \in \Omega_{2} \end{array}\right.uN(x,ε)={u1N1(x,ε),xΩ1u2N2(x,ε),xΩ2
$$
u 1 N 1 ( x , ε ) = k = 0 N 1 a k T k ( ξ ) , x = a 2 a 1 2 ξ + a 2 + a 1 2 u 2 N 2 ( x , ε ) = k = 0 N 2 b k T k ( ξ ) , x = a 3 a 2 2 ξ + a 3 + a 2 2 u 1 N 1 ( x , ε ) = k = 0 N 1 a k T k ( ξ ) , x = a 2 a 1 2 ξ + a 2 + a 1 2 u 2 N 2 ( x , ε ) = k = 0 N 2 b k T k ( ξ ) , x = a 3 a 2 2 ξ + a 3 + a 2 2 {:[u_(1)^(N_(1))(x","epsi)=sum_(k=0)^(N_(1))a_(k)T_(k)(xi)","x=(a_(2)-a_(1))/(2)xi+(a_(2)+a_(1))/(2)],[u_(2)^(N_(2))(x","epsi)=sum_(k=0)^(N_(2))b_(k)T_(k)(xi)","x=(a_(3)-a_(2))/(2)xi+(a_(3)+a_(2))/(2)]:}\begin{aligned} & u_{1}^{N_{1}}(x, \varepsilon)=\sum_{k=0}^{N_{1}} a_{k} T_{k}(\xi), x=\frac{a_{2}-a_{1}}{2} \xi+\frac{a_{2}+a_{1}}{2} \\ & u_{2}^{N_{2}}(x, \varepsilon)=\sum_{k=0}^{N_{2}} b_{k} T_{k}(\xi), x=\frac{a_{3}-a_{2}}{2} \xi+\frac{a_{3}+a_{2}}{2} \end{aligned}u1N1(x,ε)=k=0N1akTk(ξ),x=a2a12ξ+a2+a12u2N2(x,ε)=k=0N2bkTk(ξ),x=a3a22ξ+a3+a22
$
a_{1}=-1, a_{2}=1-m \varepsilon, a_{3}=1$.
Problem (1.1) is split into the following two, only the first remaining singularly perturbed
(2.4) { 4 ε 2 m ε u 1 + u 1 = 0 , 1 < ξ < 1 u 1 ( 1 ) = 1 (2.4) 4 ε 2 m ε u 1 + u 1 = 0 , 1 < ξ < 1 u 1 ( 1 ) = 1 {:(2.4){[-(4epsi)/(2-m epsi)u^('')_(1)+u_(1)^(')=0","-1 < xi < 1],[u_(1)(-1)=1]:}:}\left\{\begin{array}{l} -\frac{4 \varepsilon}{2-m \varepsilon} u^{\prime \prime}{ }_{1}+u_{1}^{\prime}=0,-1<\xi<1 \tag{2.4}\\ u_{1}(-1)=1 \end{array}\right.(2.4){4ε2mεu1+u1=0,1<ξ<1u1(1)=1
(2.5) { 4 m u 2 + u 2 = 0 , 1 < ξ < 1 u 2 ( 1 ) = 0 u 1 ( 1 ) = u 2 ( 1 ) d u 1 ( 1 ) d ξ = d u 2 ( 1 ) d ξ (2.5) 4 m u 2 + u 2 = 0 , 1 < ξ < 1 u 2 ( 1 ) = 0 u 1 ( 1 ) = u 2 ( 1 ) d u 1 ( 1 ) d ξ = d u 2 ( 1 ) d ξ {:(2.5){[-(4)/(m)u_(2)^('')+u_(2)^(')=0","-1 < xi < 1],[u_(2)(1)=0],[u_(1)(-1)=u_(2)(-1)],[(du_(1)(-1))/(dxi)=(du_(2)(-1))/(dxi)]:}:}\left\{\begin{array}{l} -\frac{4}{m} u_{2}^{\prime \prime}+u_{2}^{\prime}=0,-1<\xi<1 \tag{2.5}\\ u_{2}(1)=0 \\ u_{1}(-1)=u_{2}(-1) \\ \frac{\mathrm{d} u_{1}(-1)}{\mathrm{d} \xi}=\frac{\mathrm{d} u_{2}(-1)}{\mathrm{d} \xi} \end{array}\right.(2.5){4mu2+u2=0,1<ξ<1u2(1)=0u1(1)=u2(1)du1(1)dξ=du2(1)dξ
The Chebyshev-tau system coresponding to (2.4) and (2.5) will be
c 0 = 2 , c k = 1 , k 1 c 0 = 2 , c k = 1 , k 1 c_(0)=2,c_(k)=1,k >= 1c_{0}=2, c_{k}=1, k \geq 1c0=2,ck=1,k1. System (2.6) has N 1 + N 2 + 2 N 1 + N 2 + 2 N_(1)+N_(2)+2N_{1}+N_{2}+2N1+N2+2 equations and a i , i = 0 , 1 , , N 1 , b i a i , i = 0 , 1 , , N 1 , b i a_(i),i=0,1,dots,N_(1),b_(i)a_{i}, i=0,1, \ldots, N_{1}, b_{i}ai,i=0,1,,N1,bi, i = 0 , 1 , , N 2 i = 0 , 1 , , N 2 i=0,1,dots,N_(2)i=0,1, \ldots, N_{2}i=0,1,,N2 unknowns. We expected the algebraic system (2.6) to be better conditioned than system (2.2) because there is a less extreme ratio of the largest to smallest coefficient. And indeed comparing (2.2) and (2.6), this is the case.
The Cebyshev-tau system for problem (1.2) reads as follows
(2.7) { 2 | m | , | p | N m + p n + 1 n + m + p odd p a ¯ m a ¯ p + ε m = n + 2 m + n even m ( m 2 n 2 ) a m = f n , 0 n N 2 n = 0 N a n = n = 0 N ( 1 ) n a n = 0 (2.7) 2 | m | , | p | N m + p n + 1 n + m + p  odd  p a ¯ m a ¯ p + ε m = n + 2 m + n  even  m m 2 n 2 a m = f n , 0 n N 2 n = 0 N a n = n = 0 N ( 1 ) n a n = 0 {:(2.7){[-2sum_({:[|m|","|p| <= N],[m+p >= n+1],[n+m+p" odd "]:})p bar(a)_(m) bar(a)_(p)+epsisum_({:[m=n+2],[m+n" even "]:})m(m^(2)-n^(2))a_(m)=f_(n)","0 <= n <= N-2],[sum_(n=0)^(N)a_(n)=sum_(n=0)^(N)(-1)^(n)a_(n)=0]:}:}\left\{\begin{array}{l} -2 \sum_{\substack{|m|,|p| \leq N \\ m+p \geq n+1 \\ n+m+p \text { odd }}} p \bar{a}_{m} \bar{a}_{p}+\varepsilon \sum_{\substack{m=n+2 \\ m+n \text { even }}} m\left(m^{2}-n^{2}\right) a_{m}=f_{n}, 0 \leq n \leq N-2 \tag{2.7}\\ \sum_{n=0}^{N} a_{n}=\sum_{n=0}^{N}(-1)^{n} a_{n}=0 \end{array}\right.(2.7){2|m|,|p|Nm+pn+1n+m+p odd pa¯ma¯p+εm=n+2m+n even m(m2n2)am=fn,0nN2n=0Nan=n=0N(1)nan=0
where a ¯ m = c m a | m | a ¯ m = c m a | m | bar(a)_(m)=c_(m∣)a_(|m|)\bar{a}_{m}=c_{m \mid} a_{|m|}a¯m=cma|m| for | m | N , c 0 = 2 , c n = 1 , n 1 | m | N , c 0 = 2 , c n = 1 , n 1 |m| <= N,c_(0)=2,c_(n)=1,n >= 1|m| \leq N, c_{0}=2, c_{n}=1, n \geq 1|m|N,c0=2,cn=1,n1, and f n f n f_(n)f_{n}fn are the Chebyshev series coefficients of f ( x ) f ( x ) f(x)f(x)f(x). This system is of course a nonlinear one.
All algebraic linear systems encountered in this work were solved by Gauss type method. These systems have a quasi upper triangular form, only the equations corresponding to boundary conditions in (2.2) or (2.6) contain all unknowns.
The SOR methods was unsuccessful in solving the nonlinear system (2.7). Some methods of gradient type (Friedman) were very slowly convergent. Only the classical Newton method was successful.

3. NUMERICAL RESULTS AND DISCUSSIONS

In Fig. 1 are displayed the exact solution of (1.1) for ε = 0.01 ε = 0.01 epsi=0.01\varepsilon=0.01ε=0.01, u ( x , ε ) = a ( 1 e 1 x 2 ε ) , a = ( 1 e 1 ε ) 1 u ( x , ε ) = a 1 e 1 x 2 ε , a = 1 e 1 ε 1 u(x,epsi)=a(1-e^(-(1-x)/(2epsi))),a=(1-e^(-(1)/(epsi)))^(-1)u(x, \varepsilon)=a\left(1-e^{-\frac{1-x}{2 \varepsilon}}\right), a=\left(1-e^{-\frac{1}{\varepsilon}}\right)^{-1}u(x,ε)=a(1e1x2ε),a=(1e1ε)1 denoted by solid curve, solution (2.1) which is the oscillating curve, and the smoothed solution, cosmetic post-processed (2.3), the dashed curve, extremely close to the exact solution. For both approximations we used N = 16 N = 16 N=16N=16N=16 and the coefficients σ n σ n sigma_(n)\sigma_{n}σn correspond to the raised cosine.
The smoothed approximation looks superior to the unsmoothed solution.
The solution u 2 N 2 ( x , ε ) u 2 N 2 ( x , ε ) u_(2)^(N_(2))(x,epsi)u_{2}^{N_{2}}(x, \varepsilon)u2N2(x,ε), for problem (1.1) with ε = 10 3 , N 2 = 8 ε = 10 3 , N 2 = 8 epsi=10^(-3),N_(2)=8\varepsilon=10^{-3}, N_{2}=8ε=103,N2=8 and m = 15 m = 15 m=15m=15m=15 is presented in Fig. 2, the upper line being the exact solution.
Fig. 1
Fig. 2
The exact solution and the approximation u 1 N 1 ( x , ε ) u 1 N 1 ( x , ε ) u_(1)^(N_(1))(x,epsi)u_{1}^{N_{1}}(x, \varepsilon)u1N1(x,ε) look identically even if N 1 N 1 N_(1)N_{1}N1 is very small ( N 1 8 ) N 1 8 (N_(1) <= 8)\left(N_{1} \leq 8\right)(N18) so we do not display them.
Figures 3 and 4 display approximations (2.1) with N = 8 , 16 , 32 N = 8 , 16 , 32 N=8,16,32N=8,16,32N=8,16,32 of problem
(1.2) with ε = 0.1 ε = 0.1 epsi=0.1\varepsilon=0.1ε=0.1 for f ( x ) = x 2 f ( x ) = x 2 f(x)=x^(2)f(x)=x^{2}f(x)=x2 and f ( x ) = { 0 , x [ 1 , 0 ] 1 , x ( 0 , 1 ] f ( x ) = 0 , x [ 1 , 0 ] 1 , x ( 0 , 1 ] f(x)={[0",",x in[-1","0]],[1",",x in(0","1]]:}f(x)=\left\{\begin{array}{cc}0, & x \in[-1,0] \\ 1, & x \in(0,1]\end{array}\right.f(x)={0,x[1,0]1,x(0,1], respectively.
They show that the approximations for N = 16 N = 16 N=16N=16N=16 and N = 32 N = 32 N=32N=32N=32 are very close to each other, the approximation for N = 8 N = 8 N=8N=8N=8 being the oscillating line.
With the same entries, for ε = 0.01 ε = 0.01 epsi=0.01\varepsilon=0.01ε=0.01, only smoothed solutions (2.3) of order N = 16 , 32 , 64 N = 16 , 32 , 64 N=16,32,64N=16,32,64N=16,32,64 and unsmoothed solutions (2.1) of order greater than N = 64 N = 64 N=64N=64N=64 look close and sufficiently smooth. These results and other ones worked out but undisplayed in this paper, show that lowering ε ε epsi\varepsilonε for both linear and especially nonlinear problems a rapidly increasing order of approximation N N NNN is needed.
When a qualitative behaviour of solution would enable a domain decomposition, this would provide very accurate solutions with a less important computational effort (CPU time and storage requirements).
In all examples carried out in this paper we used in addition to smoothing factors, σ n σ n sigma_(n)\sigma_{n}σn corresponding to the raised cosine, the Cesaro sums and the Lanczos smoothing factors. The raised cosine seems to be the most effective.
Fig. 3
Fig. 4
In our opinion these numerical experiments underline the superiority of the spectral method of Chebyshev-tau type on the finite differences and finite elements method in solving singularly perturbed t.p.b.v.p. Of course these numerical results are important in starting numerical procedures for unsteady variants of (1.1) and (1.2) and they encourage us to go on to multidimensional problems.

REFERENCES

  1. C. Canuto, M.Y. Hussaini, A. Quarteroni, T.A. Zang, Spectral Methods in Fluid Dynamics, Springer-Verlag, Springer Series in Computational Physics, 1988.
  2. C.I. Gheorghiu, On a Linear Singulary Perturbed TPBVP, Univ. of Cluj-Napoca, Seminar of Functional Analysis and Numerical Methods, Preprint 1 (1988), pp. 67-74.
  3. D. Gottlieb, S.A Orszag, Numerical Analysis of Spectral Methods: Theory and Applications, SIAM Philadelphia, 1977.
  4. C. Johnson, Numerical solutions of p.d.e. by the f.e.m., Cambridge Univ. Press, 1987.
  5. R.B. Kellog, A. Tsan, Analysis of some difference approximations for a singular perturbation problem without turning points, Math. Comput. 32, 1025-1039 (1978).
  6. Y. Maday, A. Quarteroni, Legendre and Cebyshev Spectral Approximations of Burgers' Equation, Numer. Math. 37, 321-332 (1981).
  7. S.A. Orszag, Accurate Solution of the Orr-Sommerfeld stability equation, J. Fluid Mech., 50, 689-703 (1971).
  8. M. Stynes, E. O'Riordan, An analysis of a t.p.b.v.p. with a boundary layer, using only finite element techniques, Univ. College Cork, Ireland, 1989.
Received 1 XII 1992
C.I. Gheorghiu Academia Română Institutul de Calcul ,, Tiberiu Popoviciu " P.O. Box 68 3400 Cluj-Napoca 1 România
S.I. Pop
"Babes-Bolyai" University Faculty of Mathematics R-3400 Cluj-Napoca
Romania
1995

Related Posts