2005
DOI: 10.1016/j.cam.2004.11.047
|View full text |Cite
|
Sign up to set email alerts
|

A note on a parameterized singular perturbation problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 35 publications
(28 citation statements)
references
References 10 publications
0
27
0
Order By: Relevance
“…The values of ε and N , for which we solve the test problem, are ε = 2 -i , i = 0, 4,8,12,16; N = 64, 128, 256, 512, 1024. From Tables 1 and 2 we observe that ε-uniform experimental rates of convergence monotonically increase towards one, which is in agreement with the theoretical rate given by Theorem 3.1.…”
Section: Algorithm and Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The values of ε and N , for which we solve the test problem, are ε = 2 -i , i = 0, 4,8,12,16; N = 64, 128, 256, 512, 1024. From Tables 1 and 2 we observe that ε-uniform experimental rates of convergence monotonically increase towards one, which is in agreement with the theoretical rate given by Theorem 3.1.…”
Section: Algorithm and Numerical Resultsmentioning
confidence: 99%
“…Uniform convergent finite-difference schemes for solving parameterized singularly perturbed two-point boundary value problems have been considered in [8,10,[15][16][17][18][19][20][21][22] (see also references therein). In [8,10,16,17,19,20] authors used the boundary layer technique for solving an analogous problem. A methodology based on the homotopy analysis technique to approximate the analytic solution was investigated in [15,21,22].…”
Section: Introductionmentioning
confidence: 99%
“…Hence, if denote by τ (1) p and τ (2) p the stepsizes in [r p−1 , σ p ] and [σ p , r p ] respectively, we have…”
Section: The Difference Scheme and Meshmentioning
confidence: 99%
“…Finally, in Section 5, we formulate the iterative algorithm for solving the discrete problem and present numerical results which validate the theoretical analysis computationally. The technique to construct discrete problem and error analysis for approximate solution is similar to those in [1,2].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation