×

zbMATH — the first resource for mathematics

Dynamic programming and ill-conditioned linear systems. II. (English) Zbl 0217.17704

MSC:
49L20 Dynamic programming in optimal control and differential games
90C39 Dynamic programming
65F35 Numerical computation of matrix norms, conditioning, scaling
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bellman, R.E; Kalaba, R.E; Lockett, Jo Ann, Dynamic programming and ill-conditioned linear systems, () · Zbl 0128.39302
[2] Bellman, R.E; Kalaba, R.E; Lockett, Jo Ann, Numerical solution of functional equations by means of Laplace transform—I: renewal equation, ()
[3] Bellman, R.E; Kalaba, R.E; Lockett, Jo Ann, Numerical solution of functional equations by means of Laplace transform—II: differential difference equations, ()
[4] Bellman, R.E; Kalaba, R.E; Lockett, Jo Ann, Numerical solution of functional equations by means of Laplace transform—III: the diffusion equation, ()
[5] Bellman, R.E; Kalaba, R.E; Lockett, Jo Ann, Numerical solution of functional equations by means of Laplace transform—IV: nonlinear equations, ()
[6] Bellman, R.E; Kalaba, R.E; Lockett, Jo Ann, Numerical solution of functional equations by means of Laplace transform—V: mismatched systems of linear differential equations, ()
[7] Bellman, R.E; Kalaba, R.E, Quasilinearization, (1964), Elsevier New York · Zbl 0165.18103
[8] Bellman, R.E; Kagiwada, H.H; Kalaba, R.E, A computational procedure for optimal system design and utilization, (), 1524-1528 · Zbl 0112.06401
[9] Bellman, R.E; Kagiwada, H.H; Kalaba, R.E, Orbit determination as a multi-point boundary-value problem and quasilinearization, (), 1327-1329 · Zbl 0108.12602
[10] Bellman, R.E, Dynamic programming, (1954), Princeton Univ. Press Princeton, New Jersey
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.