Dynamic programming, reduction of dimensionality and eigenvalue problems

DOI10.1016/0898-1221(88)90189-7zbMath0671.49035OpenAlexW2049512196MaRDI QIDQ1119904

N. G. F. Sancho, K. Y. K. Ng

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90189-7

zbMATH Keywords

algorithmeigenvalue problemsBellman's principle of optimalitynominal trajectoryminimal storage requirementsBellman's curse of dimensionalitydesorption from a liquid film

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming algorithm for optimizing distributed parameter trajectories with constraints
• A new algorithm for solving certain variational problems
• A new algorithm for multi-dimensional dynamic programming problems
• Introduction to the mathematical theory of control processes. Vol I: Linear equations and quadratic criteria
• Quasilinearization and invariant imbedding. With applications to chemical engineering and adaptive control
• Eigenvalues of the Laplacian in Two Dimensions
• A new algorithm for the solution of multi-state dynamic programming problems

This page was built for publication: Dynamic programming, reduction of dimensionality and eigenvalue problems