A dynamic programming method is introduced for piecewise linear approximation of vector fields in nonlinear BVPs on [0,1], producing convergent subsequences under finer discretization when a true solution exists.
Keller, Numerical solution of two point boundary value problems Vol
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dynamic Programming Method for Best Piecewise Linear Approximation for Vector Field of Nonlinear Boundary Value Problems on the Interval [0, 1]
A dynamic programming method is introduced for piecewise linear approximation of vector fields in nonlinear BVPs on [0,1], producing convergent subsequences under finer discretization when a true solution exists.