33 pages matching dynamic programming in this book
Results 1-3 of 33
What people are saying - Write a review
We haven't found any reviews in the usual places.
CHAPTER ONE The Riccati Equation
91 other sections not shown
algorithm analysis analytic application of quasilinearization approach approximation techniques Bellman boundary conditions calculation characteristic value coefficients consider convex denote differential approximation differential inequalities dipole discussion dynamic programming establish Euler equation existence and uniqueness fashion functional equations given Green's function Hence initial approximation initial condition initial values integration Invariant Imbedding INVERSE PROBLEM iteration Kagiwada Kalaba linear algebraic linear algebraic equations linear differential equation linear equation linear systems lower bound Math mathematical matrix method minimum Monotone Convergence Nonlinear Differential Equations nonnegativity numerical solution observation obtain optimal ordinary differential equations parameters partial differential equations Picard Proc procedure Processes quadratic convergence quasilinearization quasilinearization technique RAND Corporation recurrence relation Riccati equation satisfies sequence of approximations simple solve storage successive approximations sufficiently small tangent theorem tion two-point boundary two-point boundary-value problems un+1 value problem variable variational problem vector vector-matrix write xn+1 yields