Analysis of IVPs and BVPs on semi-infinite domains via collocation methods

Mohammad Maleki, Ishak Hashim, Saeid Abbasbandy

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

We study the numerical solutions to semi-infinite-domain two-point boundary value problems and initial value problems. A smooth, strictly monotonic transformation is used to map the semi-infinite domain x ∈ [0, ∞) onto a half-open interval t ∈ [-1, 1). The resulting finite-domain two-point boundary value problem is transcribed to a system of algebraic equations using Chebyshev-Gauss (CG) collocation, while the resulting initial value problem over a finite domain is transcribed to a system of algebraic equations using Chebyshev-Gauss-Radau (CGR) collocation. In numerical experiments, the tuning of the map φ:[-1,+ 1) → [0,+∞) and its effects on the quality of the discrete approximation are analyzed.

Original languageEnglish
Article number696574
JournalJournal of Applied Mathematics
Volume2012
DOIs
Publication statusPublished - 2012

Fingerprint

Infinite Domain
Initial value problems
Two-point Boundary Value Problem
Collocation Method
Chebyshev
Collocation
Algebraic Equation
Gauss
Boundary value problems
Initial Value Problem
Open interval
Discrete Approximation
Monotonic
Tuning
Strictly
Numerical Experiment
Numerical Solution
Experiments

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

Analysis of IVPs and BVPs on semi-infinite domains via collocation methods. / Maleki, Mohammad; Hashim, Ishak; Abbasbandy, Saeid.

In: Journal of Applied Mathematics, Vol. 2012, 696574, 2012.

Research output: Contribution to journalArticle

@article{4099b157be5e4360a84230d727bfc0e5,
title = "Analysis of IVPs and BVPs on semi-infinite domains via collocation methods",
abstract = "We study the numerical solutions to semi-infinite-domain two-point boundary value problems and initial value problems. A smooth, strictly monotonic transformation is used to map the semi-infinite domain x ∈ [0, ∞) onto a half-open interval t ∈ [-1, 1). The resulting finite-domain two-point boundary value problem is transcribed to a system of algebraic equations using Chebyshev-Gauss (CG) collocation, while the resulting initial value problem over a finite domain is transcribed to a system of algebraic equations using Chebyshev-Gauss-Radau (CGR) collocation. In numerical experiments, the tuning of the map φ:[-1,+ 1) → [0,+∞) and its effects on the quality of the discrete approximation are analyzed.",
author = "Mohammad Maleki and Ishak Hashim and Saeid Abbasbandy",
year = "2012",
doi = "10.1155/2012/696574",
language = "English",
volume = "2012",
journal = "Journal of Applied Mathematics",
issn = "1110-757X",
publisher = "Hindawi Publishing Corporation",

}

TY - JOUR

T1 - Analysis of IVPs and BVPs on semi-infinite domains via collocation methods

AU - Maleki, Mohammad

AU - Hashim, Ishak

AU - Abbasbandy, Saeid

PY - 2012

Y1 - 2012

N2 - We study the numerical solutions to semi-infinite-domain two-point boundary value problems and initial value problems. A smooth, strictly monotonic transformation is used to map the semi-infinite domain x ∈ [0, ∞) onto a half-open interval t ∈ [-1, 1). The resulting finite-domain two-point boundary value problem is transcribed to a system of algebraic equations using Chebyshev-Gauss (CG) collocation, while the resulting initial value problem over a finite domain is transcribed to a system of algebraic equations using Chebyshev-Gauss-Radau (CGR) collocation. In numerical experiments, the tuning of the map φ:[-1,+ 1) → [0,+∞) and its effects on the quality of the discrete approximation are analyzed.

AB - We study the numerical solutions to semi-infinite-domain two-point boundary value problems and initial value problems. A smooth, strictly monotonic transformation is used to map the semi-infinite domain x ∈ [0, ∞) onto a half-open interval t ∈ [-1, 1). The resulting finite-domain two-point boundary value problem is transcribed to a system of algebraic equations using Chebyshev-Gauss (CG) collocation, while the resulting initial value problem over a finite domain is transcribed to a system of algebraic equations using Chebyshev-Gauss-Radau (CGR) collocation. In numerical experiments, the tuning of the map φ:[-1,+ 1) → [0,+∞) and its effects on the quality of the discrete approximation are analyzed.

UR - http://www.scopus.com/inward/record.url?scp=84862297300&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862297300&partnerID=8YFLogxK

U2 - 10.1155/2012/696574

DO - 10.1155/2012/696574

M3 - Article

AN - SCOPUS:84862297300

VL - 2012

JO - Journal of Applied Mathematics

JF - Journal of Applied Mathematics

SN - 1110-757X

M1 - 696574

ER -