Approximation of the solution of certain nonlinear ODEs with linear complexity (Q847187): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2009.10.019 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2009.10.019 / rank
 
Normal rank

Latest revision as of 05:09, 10 December 2024

scientific article
Language Label Description Also known as
English
Approximation of the solution of certain nonlinear ODEs with linear complexity
scientific article

    Statements

    Approximation of the solution of certain nonlinear ODEs with linear complexity (English)
    0 references
    0 references
    12 February 2010
    0 references
    This paper deals with a finite difference method for the approximation of semilinear elliptic problems in one dimension subject to nonlinear Neumann boundary conditions. The main result provides an algorithm which computes an \(\varepsilon-\)approximation of a positive solution for the semilinear problem. Such an algorithm relies on the homotopy continuation method. It is also proved that the cost of the algorithm is linear in terms of the number of nodes involved in the discretization.
    0 references
    0 references
    Two-point boundary problem
    0 references
    Finite differences
    0 references
    Neumann boundary condition
    0 references
    homotopy continuation
    0 references
    complexity
    0 references
    algorithm
    0 references
    positive solution
    0 references
    semilinear problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references