pith. sign in

arxiv: 1906.10403 · v2 · pith:RJ743E34new · submitted 2019-06-25 · 🧮 math.NA · cs.NA

Dynamic Programming Method for Best Piecewise Linear Approximation for Vector Field of Nonlinear Boundary Value Problems on the Interval [0, 1]

Duggirala Meher Krishna , Duggirala Ravi This is my paper

Pith reviewed 2026-05-25 16:48 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords dynamic programmingpiecewise linear approximationboundary value problemnonlinear ODEnumerical stabilityvector field approximationconvergence
0
0 comments X

The pith

Dynamic programming finds the optimal piecewise linear approximation to the vector field of nonlinear boundary value problems while preserving boundary conditions and numerical stability.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a dynamic programming method to approximate the vector field of nonlinear boundary value problems with the best piecewise linear function on the interval from 0 to 1. The approximation is constructed to maintain the given boundary conditions and to ensure the numerical stability of the scheme. When a true solution exists, successive refinements of the discretization produce a subsequence of approximate solutions that converge to it. Readers in numerical analysis would care because the approach directly tackles the convergence and stability problems that arise in solving such differential equations computationally.

Core claim

The method uses dynamic programming to determine the best piecewise linear approximation for the vector field, simultaneously preserving boundary conditions and guaranteeing numerical stability. If a true solution exists, finer discretization of the solution space yields a subsequence convergent to one such solution.

What carries the argument

Dynamic programming optimization of piecewise linear vector field approximations

If this is right

  • The boundary conditions are preserved throughout the approximation process.
  • Numerical stability of the scheme is guaranteed by the method.
  • Refining the discretization produces a convergent subsequence to the true solution when one exists.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This technique could potentially be adapted for boundary value problems on different intervals or with different boundary condition types.
  • Similar dynamic programming strategies might apply to approximating vector fields in other classes of differential equations.

Load-bearing premise

The vector field allows for a piecewise linear approximation that can be optimized by dynamic programming in a way that keeps boundary conditions intact and maintains numerical stability.

What would settle it

For a nonlinear boundary value problem with a known exact solution, if increasing the number of discretization points does not yield approximate solutions approaching the true one, the convergence claim would be falsified.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper proposes a dynamic programming method to compute the best piecewise linear approximation to the vector field of a nonlinear boundary value problem on the interval [0,1]. The approach is intended to preserve boundary conditions and numerical stability. The central claim is that, whenever a true solution exists, successively finer discretizations of the solution space produce a subsequence of approximate solutions that converges to a true solution.

Significance. If the convergence claim can be established with explicit error bounds and stability guarantees, the method would supply a new, potentially efficient computational procedure for nonlinear BVPs that arise in engineering applications. The manuscript currently supplies no derivation of the claimed convergence, no stability analysis, and no numerical verification, so the practical significance cannot yet be assessed.

major comments (1)
  1. [Abstract] Abstract: the statement that 'a subsequence of solutions convergent to one such can be produced, by finer discretization of the solution space' is presented without any derivation, error estimate, stability argument, or numerical test. This is the load-bearing claim of the paper and must be supplied with a concrete proof or counter-example before the result can be evaluated.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and the constructive comment on the central claim of the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the statement that 'a subsequence of solutions convergent to one such can be produced, by finer discretization of the solution space' is presented without any derivation, error estimate, stability argument, or numerical test. This is the load-bearing claim of the paper and must be supplied with a concrete proof or counter-example before the result can be evaluated.

    Authors: We agree that the convergence statement in the abstract is the load-bearing claim and that the current manuscript does not contain an explicit derivation, error estimates, stability analysis, or numerical verification. In the revised version we will add a dedicated theoretical section deriving the subsequence convergence result from the dynamic-programming construction, together with a basic stability argument for the piecewise-linear approximation and at least one numerical illustration on a model nonlinear BVP. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper describes a dynamic programming algorithm for constructing piecewise-linear approximations to the vector field of a nonlinear BVP while enforcing boundary conditions. The central claim is that, when a true solution exists, successive refinements of the discretization produce a convergent subsequence. No equations, fitted parameters, or self-citations appear in the abstract or the described method that would reduce any claimed result to an input by construction. The procedure is presented as an independent computational scheme whose convergence argument relies on standard compactness considerations rather than on any self-referential definition or fitted quantity.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the domain assumption that a true solution exists and that the vector field is sufficiently regular for piecewise-linear approximation to be meaningful; no free parameters or invented entities are mentioned.

axioms (2)
  • domain assumption Existence of a true solution to the nonlinear BVP
    The convergence statement is explicitly conditional on this existence; without it the subsequence claim does not apply.
  • domain assumption The vector field admits a piecewise-linear approximation that preserves boundary conditions and numerical stability
    This premise is required for the dynamic-programming step to produce usable discrete solutions.

pith-pipeline@v0.9.0 · 5628 in / 1279 out tokens · 30525 ms · 2026-05-25T16:48:54.542550+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages

  1. [1]

    Kalaba, Dynamic programming and mod- ern control theory , Academic Press, New York, 1965, pp

    Bellman, Richard, and Robert E. Kalaba, Dynamic programming and mod- ern control theory , Academic Press, New York, 1965, pp. 195–209

    work page 1965

  2. [2]

    Codes for boundary value problems in ordinary differential equations

    J. W. Daniel, A road map of methods for approximating solutions of two point boundary value problems , in “Codes for boundary value problems in ordinary differential equations”, Bart Childs, Melvin R. Scott, Jame s W. Daniel, Eugene D. Denman, Paul Nelson (Eds.), Proceedings of a Wor king Conference May 14-17, 1978, LNCS Vol. 76, Springer Verlag, 1979

    work page 1978

  3. [3]

    Finlayson, The method of weighted residual and variational prin- cipals, Academic Press, 1972

    Bruce A. Finlayson, The method of weighted residual and variational prin- cipals, Academic Press, 1972

    work page 1972

  4. [4]

    Dover Publications, 1990

    Leslie Fox, The numerical solution of two-point boundary problems in or - dinary differential equations . Dover Publications, 1990

    work page 1990

  5. [5]

    C. M. Garcia-L´ opez, and J. I. Ramos, A piecewise-linearized method for ordinary differential equations: two-point boundary-valu e problems , Inter- national Journal of Numerical Methods in Fluids, vol. 22, Issue 11, pp.1089- 1102 14

    work page

  6. [6]

    Hindmarsh, Peter N

    Alan.C. Hindmarsh, Peter N. Brown, Keith E. Grant, Steven L. Le e, Radu Serban, Dan E. Shumaker and Carol S. Woodward, SUNDIALS: Suite of nonlinear and differential/algebraic equation solvers , ACM Transactions on Mathematical Software, Special issue on Advanced CompuTationa l Soft- ware (ACTS), Vol. 31, Issue 3, September 2005

    work page 2005

  7. [7]

    Keller, Numerical solution of two point boundary value problems Vol

    Herbert B. Keller, Numerical solution of two point boundary value problems Vol. 24. Society for Industrial Mathematics, 1987

    work page 1987

  8. [8]

    Malladi, J

    R. Malladi, J. A. Sethian and B. C, Vemuri, Shape modeling with front propagation: a level set approach , IEEE Trans. on PAMI, vol 17(2), 1995, pp. 158-175

    work page 1995

  9. [9]

    C. P. Neuman and A. Sen, Galerkin’s procedure, quasilinearization, and nonlinear boundary-value problems , Journal of Optimization Theory and Applications, Vol. 9, No. 6 / June 1972, pp. 433-437

    work page 1972

  10. [10]

    Osborne, M.R., On Shooting methods for boundary value problems , J. Math. Anal. Appl. 27, 417-433 (1969)

    work page 1969

  11. [11]

    L. S. Ramachandra and D. Roy, A new method for nonlinear two-point boundary value problems in solid mechanics , Journal of Applied Mechanics, September 2001, Volume 68, Issue 5, pp. 776-786

    work page 2001

  12. [12]

    J. I. Ramos, Piecewise quasilinearization techniques for singular bou ndary- value problems Computer Physics Commmunicaions, Vol. 158, Issue 1, March 2004, pp. 12-25

    work page 2004

  13. [13]

    Shipman, Two-point boundary value problems: shooting methods (Modern analytic and computational methods in science and mathematics), American Elsevier Pub

    Sanford M Roberts, and Jerome S. Shipman, Two-point boundary value problems: shooting methods (Modern analytic and computational methods in science and mathematics), American Elsevier Pub. Co., First Edition edition, 1972

    work page 1972

  14. [14]

    Varaiya, Reach set computation using optimal control , Proceedings of KIT Workshop, Verimag, Grenoble, 1998

    P. Varaiya, Reach set computation using optimal control , Proceedings of KIT Workshop, Verimag, Grenoble, 1998. 15

    work page 1998