Automatically identifying the asymptotic behavior of nonlinear singularly perturbed boundary value problems (Q1197389)

From MaRDI portal
Revision as of 11:18, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Automatically identifying the asymptotic behavior of nonlinear singularly perturbed boundary value problems
scientific article

    Statements

    Automatically identifying the asymptotic behavior of nonlinear singularly perturbed boundary value problems (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    This paper describes a computational procedure designed to automatically analyze the behavior of certain general classes of nonlinear singular perturbation problems by applying the combined results of a body of theory that proves the existence of solutions for these problems. There is also a computer program which the authors created that implements the computational procedure. The core mathematical knowledge contained in the program is composed of rules that embody the results of mathematical theorems from nonlinear singular perturbation theory. The principle method of proof used in the mathematical theory yields an estimate of a solution by constructing sharp bounding functions that define a region in which the solution exists uniquely. As a result, a successful application of the program produces an approximation of a solution as a side effect. In addition, the mathematical theory can be used to show the existence of multiple solutions for a nonlinear singulary perturbed boundary value problem. This feature is also reflected in the results obtained from the program. The ability to construct such a program depends critically on the successful coupling of a non-deterministic program technique called path-finding with the capabilities of a computer algebra system.
    0 references
    path-finding
    0 references

    Identifiers