On the Nipp polyhedron algorithm for solving singular perturbation problems

R. Khanin

Mathematics and Computers in Simulation (MATCOM), 2002, vol. 58, issue 3, 255-272

Abstract: This paper deals with a constructive approach for finding local approximations to singular perturbation problems. This approach is based on Nipp polyhedron algorithm wherein a correspondence between a singularly perturbed system and a convex polyhedron is established. The task of finding local approximations reduces to the linear programming problem of finding vertices of polyhedron adjacent to the zero vertex. The paper presents Nipp polyhedron algorithm and considers its computer implementation in Maple. Two non-trivial examples are given.

Keywords: Singular perturbation; Polyhedron algorithm; Asymptotic expansions (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475401003548
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:58:y:2002:i:3:p:255-272

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().