Dynamic Programming Method for Best Piecewise Linear Approximation for Vector Field of Nonlinear Boundary Value Problems on the Interval [0, 1]
Numerical Analysis
2019-07-17 v2 Numerical Analysis
Abstract
An important problem that arises in many engineering applications is the boundary value problem for ordinary differential equations. There have been many computational methods proposed for dealing with this problem. The convergence of the iterative schemes to a true solution, when one such exists, and their numerical stability are the central issues discussed in the literature. In this paper, we discuss a method for approximating the vector field, maintaining the boundary conditions and numerical stability. If a true solution exists, a subsequence of solutions convergent to one such can be produced, by finer discretization of the solution space.
Cite
@article{arxiv.1906.10403,
title = {Dynamic Programming Method for Best Piecewise Linear Approximation for Vector Field of Nonlinear Boundary Value Problems on the Interval [0, 1]},
author = {Duggirala Meher Krishna and Duggirala Ravi},
journal= {arXiv preprint arXiv:1906.10403},
year = {2019}
}