An efficient algorithm for solving Troesch's problem

Xinlong Feng; Liquan Mei; Guoliang He

doi:10.1016/j.amc.2006.11.161

An efficient algorithm for solving Troesch's problem

Xinlong Feng
, Liquan Mei
, Guoliang He

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

75 Scopus citations

Abstract

A new algorithm is presented for solving Troesch's problem. The numerical scheme based on the modified homotopy perturbation technique is deduced. Some numerical experiments are made. Compared with the variational iteration method and the Adomian decomposition method, the scheme is shown to be highly accurate, and only a few terms are required to obtain accurate computable solutions. Finally, the algorithm is applied to other problems.

Original language	English
Pages (from-to)	500-507
Number of pages	8
Journal	Applied Mathematics and Computation
Volume	189
Issue number	1
DOIs	https://doi.org/10.1016/j.amc.2006.11.161
State	Published - 1 Jun 2007

Keywords

Adomian decomposition method
Homotopy perturbation technique
Taylor expansion
Troesch's problem
Variational iteration method

Access to Document

10.1016/j.amc.2006.11.161

Cite this

@article{50c411f914dd41ecbb3f8d5218f164c7,

title = "An efficient algorithm for solving Troesch's problem",

abstract = "A new algorithm is presented for solving Troesch's problem. The numerical scheme based on the modified homotopy perturbation technique is deduced. Some numerical experiments are made. Compared with the variational iteration method and the Adomian decomposition method, the scheme is shown to be highly accurate, and only a few terms are required to obtain accurate computable solutions. Finally, the algorithm is applied to other problems.",

keywords = "Adomian decomposition method, Homotopy perturbation technique, Taylor expansion, Troesch's problem, Variational iteration method",

author = "Xinlong Feng and Liquan Mei and Guoliang He",

year = "2007",

month = jun,

day = "1",

doi = "10.1016/j.amc.2006.11.161",

language = "英语",

volume = "189",

pages = "500--507",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - An efficient algorithm for solving Troesch's problem

AU - Feng, Xinlong

AU - Mei, Liquan

AU - He, Guoliang

PY - 2007/6/1

Y1 - 2007/6/1

N2 - A new algorithm is presented for solving Troesch's problem. The numerical scheme based on the modified homotopy perturbation technique is deduced. Some numerical experiments are made. Compared with the variational iteration method and the Adomian decomposition method, the scheme is shown to be highly accurate, and only a few terms are required to obtain accurate computable solutions. Finally, the algorithm is applied to other problems.

AB - A new algorithm is presented for solving Troesch's problem. The numerical scheme based on the modified homotopy perturbation technique is deduced. Some numerical experiments are made. Compared with the variational iteration method and the Adomian decomposition method, the scheme is shown to be highly accurate, and only a few terms are required to obtain accurate computable solutions. Finally, the algorithm is applied to other problems.

KW - Adomian decomposition method

KW - Homotopy perturbation technique

KW - Taylor expansion

KW - Troesch's problem

KW - Variational iteration method

UR - https://www.scopus.com/pages/publications/34248395626

U2 - 10.1016/j.amc.2006.11.161

DO - 10.1016/j.amc.2006.11.161

M3 - 文章

AN - SCOPUS:34248395626

SN - 0096-3003

VL - 189

SP - 500

EP - 507

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 1

ER -

An efficient algorithm for solving Troesch's problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this