A computational method for solving singular perturbation problems using fourth order finite differences (Q3746818)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3982436
Language Label Description Also known as
default for all languages
No label defined
    English
    A computational method for solving singular perturbation problems using fourth order finite differences
    scientific article; zbMATH DE number 3982436

      Statements

      A computational method for solving singular perturbation problems using fourth order finite differences (English)
      0 references
      0 references
      0 references
      1986
      0 references
      linear singularly perturbed two-point boundary value problems
      0 references
      fourth order finite difference scheme
      0 references
      numerical examples
      0 references
      This paper presents a computational method for solving linear singularly perturbed two-point boundary value problems of type: \[ L_{\epsilon}(y)=\epsilon y''(x)+a(x)y'(x)-b(x)y(x)=f(x), \] \(x\in [0,1]\), \(y(0)=\alpha\), \(y(1)=\beta\) where \(0<\epsilon \ll 1\), a(x),b(x) and f(x) are sufficiently differentiable and b(x)\(\geq 0\), \(a(x)\geq M>0\) in [0,1]. First of all choosing \(x_ p=O(\epsilon)\) and determining \(y_ p=y(x_ p)\) as the solution of the reduced initial value problem \(L_ 0(y)=f(x)\), \(y(1)=\beta\), the original problem is divided into inner and outer region problems. Then, after rescaling the inner region problem, both these two-point boundary value problems are solved using a fourth order finite difference scheme. The authors propose to repeat this process for several terminal values \(x_ p\) until ''the solution profiles do not differ materially from iteration to iteration''. Two numerical examples are included to show the applicability of the method.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references