Approximation of the solution of certain nonlinear ODEs with linear complexity (Q847187)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5669159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of the solution of certain nonlinear ODEs with linear complexity |
scientific article; zbMATH DE number 5669159 |
Statements
Approximation of the solution of certain nonlinear ODEs with linear complexity (English)
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
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.9075236320495604
0 references
0.8927664756774902
0 references
0.8672587275505066
0 references
0.8625922203063965
0 references
