2001
DOI: 10.1002/nme.392
|View full text |Cite
|
Sign up to set email alerts
|

Chebyshev rational spectral and pseudospectral methods on a semi‐infinite interval

Abstract: SUMMARYA weighted orthogonal system on the half-line based on the Chebyshev rational functions is introduced. Basic results on Chebyshev rational approximations of several orthogonal projections and interpolations are established. To illustrate the potential of the Chebyshev rational spectral method, a model problem is considered both theoretically and numerically: error estimates for the Chebyshev rational spectral and pseudospectral methods are established; preliminary numerical results agree well with the t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
26
0
2

Year Published

2004
2004
2023
2023

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 71 publications
(28 citation statements)
references
References 16 publications
0
26
0
2
Order By: Relevance
“…Furthermore, we approximate a function using rational Chebyshev–Gauss–Radau points. The well‐known Chebyshev polynomials are orthogonal in the interval [ − 1,1] in terms of the weight function ρ(y)=11x2 and can be calculated via the following recurrence formula: T0(x)=10.3em,1emT1(x)=x Tn+1(x)=2xTn(x)Tn1(x)0.3em,1emn=1,2,3,, The new basis functions denoted by R n ( x ) are represented by in interval Ω = [0, ∞ ) Rn(x)=Tn()x1x+1. Note that R n ( x ) is the eigenfunction of the singular Sturm–Liouville problem: (x+1)xddx()(x+1)xddxRn(x)+n2Rn(x)=00.3em,1emxnormalΩ0.3em,1emn1. Thus, rational functions satisfy the following conditions: R0(x)=10.3em,1emR1(x)=x1x+1, …”
Section: Rational Chebyshev Functionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, we approximate a function using rational Chebyshev–Gauss–Radau points. The well‐known Chebyshev polynomials are orthogonal in the interval [ − 1,1] in terms of the weight function ρ(y)=11x2 and can be calculated via the following recurrence formula: T0(x)=10.3em,1emT1(x)=x Tn+1(x)=2xTn(x)Tn1(x)0.3em,1emn=1,2,3,, The new basis functions denoted by R n ( x ) are represented by in interval Ω = [0, ∞ ) Rn(x)=Tn()x1x+1. Note that R n ( x ) is the eigenfunction of the singular Sturm–Liouville problem: (x+1)xddx()(x+1)xddxRn(x)+n2Rn(x)=00.3em,1emxnormalΩ0.3em,1emn1. Thus, rational functions satisfy the following conditions: R0(x)=10.3em,1emR1(x)=x1x+1, …”
Section: Rational Chebyshev Functionsmentioning
confidence: 99%
“…Suppose N is any positive integer, thus we have: frakturRN=Span{R0,R1,,RN}. Guo et al . introduced rational Chebyshev–Guass–Radau points. Let yj=cos(2j2N+1)π0.3em,1emj=0,1,,N be the N + 1 roots of the polynomial T N ( x ) + T N + 1 ( x ).…”
Section: Rational Chebyshev Functionsmentioning
confidence: 99%
“…Accordingly, we should approximate them in the corresponding different weighted spaces. However, the commonly used orthogonal families of rational functions are induced by the Legendre or Chebyshev polynomials, see [2,8,[11][12][13][14] and the references therein. Thus, their weight functions are fixed, which might not be most appropriate in some cases.…”
Section: Introductionmentioning
confidence: 99%
“…The main advantage of this approach is that standard spectral approximation results can be used for the analysis, but its main disadvantage is that the mapped equation is usually very complicated and its analysis is often cumbersome. In the second approach, we do not transform the equation, but we approximate its solution using a new family of orthogonal functions {p k (h(x; λ))}, which are obtained by applying the mapping y = h(x; λ) to classical orthogonal polynomials {p k (y)} (see, for instance, [6,18,16]) and which are suitable for capturing the localized rapid variations in the solution of the given problem. The analysis of this approach will require approximation results by using the new family of orthogonal functions.…”
mentioning
confidence: 99%