25,161
edits
Changes
Created page with "'''Home * People * Richard E. Bellman''' FILE:richard_bellman.jpg|border|right|thumb|link=http://www.bellmanequation.com/pages/about.html| Richard E. Bell..."
'''[[Main Page|Home]] * [[People]] * Richard E. Bellman'''
[[FILE:richard_bellman.jpg|border|right|thumb|link=http://www.bellmanequation.com/pages/about.html| Richard E. Bellman <ref>[http://www.bellmanequation.com/pages/about.html The Bellman Equation, Richard Bellman, The Movie] by [http://www.zennyrun.com/ Gabriel Leif Bellman]</ref> ]]
'''Richard Ernest Bellman''', (August 26, 1920 – March 19, 1984) <br/>
was an American [https://en.wikipedia.org/wiki/Applied_mathematics applied mathematician] and inventor of [[Dynamic Programming|dynamic programming]] in 1953 while affiliated with [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]. Dynamic programming defines a mathematical theory devoted to the study of multistage processes. These processes are composed of sequences of operations in which the outcome of those preceding may be used to guide the course of future ones <ref>[[Richard E. Bellman]] ('''1953'''). ''[http://www.rand.org/pubs/reports/R245.html An Introduction to the Theory of Dynamic Programming]''. R-245, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]</ref>, an application in computer chess and games is the use of [[Transposition Table|transposition tables]] inside an [[Iterative Deepening|iterative deepening]] framework <ref>[https://en.wikipedia.org/wiki/Dynamic_programming#Algorithms_that_use_dynamic_programming Algorithms that use dynamic programming from Wikipedia]</ref>. He worked and published on [https://en.wikipedia.org/wiki/Markov_decision_process Markov decision processes], and in 1958, he published his first paper on [https://en.wikipedia.org/wiki/Stochastic_process stochastic control processes] <ref>[[Richard E. Bellman]] ('''1958'''). ''[http://www.sciencedirect.com/science/article/pii/S0019995858800030 Dynamic Programming and Stochastic Control Processes]''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA], [http://www.sciencedirect.com/science/journal/00199958/1/3 Information and Control 1], pp. 228–239</ref>, where he introduced what is today called the [https://en.wikipedia.org/wiki/Bellman_equation Bellman equation], also known as dynamic programming equation.
During [https://en.wikipedia.org/wiki/World_War_II World War II], Bellman worked in [[Los Alamos National Laboratory|Los Alamos]] on the [https://en.wikipedia.org/wiki/Manhattan_Project Manhattan project]. He received his Ph.D. at [https://en.wikipedia.org/wiki/Princeton_University Princeton] under the supervision of [https://en.wikipedia.org/wiki/Solomon_Lefschetz Solomon Lefschetz] in 1947, and since 1949 he worked for many years at RAND, and was professor at [[University of Southern California]] since 1965. In the 50s he was persecuted by [https://en.wikipedia.org/wiki/Joseph_McCarthy McCarthy] <ref>[http://www.bellmanequation.com/pages/about.html The Bellman Equation, Richard Bellman, The Movie] by [http://www.zennyrun.com/ Gabriel Leif Bellman]</ref> <ref>[https://en.wikipedia.org/wiki/McCarthyism McCarthyism from Wikipedia]</ref>.
=Retrograde Analysis=
The dynamic programming methodology which defined the field of [[Retrograde Analysis|retrograde endgame analysis]] was discovered by Bellman in 1965 <ref>[[Richard E. Bellman]] ('''1965'''). ''[http://www.rand.org/pubs/papers/P3013/ On the Application of Dynamic Programming to the Determination of Optimal Play in Chess and Checkers].'' Proceedings of the National Academy of Sciences of the United States of America</ref>. Bellman had considered [https://en.wikipedia.org/wiki/Game_theory game theory] from a classical perspective as well <ref>[[Richard E. Bellman]] ('''1954'''). ''On a new Iterative Algorithm for Finding the Solutions of Games and Linear Programming Problems''. Technical Report P-473, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], U. S. Air Force Project RAND, [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]</ref> <ref>[[Richard E. Bellman]] ('''1957'''). ''The Theory of Games''. Technical Report P-1062, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]</ref>, but his work came to fruition in his 1965 paper, where he observed that the entire [https://en.wikipedia.org/wiki/State_space_%28dynamical_system%29 state-space] could be stored and that dynamic programming techniques could then be used to compute whether either side could win any position <ref>[[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://www.msri.org/publications/books/Book29/files/stiller.pdf pdf]</ref>.
=Selected Publications=
<ref>[http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=01102791 List of Publications: Richard Bellman]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/b/Bellman:Richard.html DBLP: Richard Bellman]</ref>
==1947==
* [[Richard E. Bellman]] ('''1947'''). ''On the Boundedness of Solutions of Non-Linear Differential and Difference Equations''. Ph.D. thesis, [http://www.ams.org/journals/tran/1947-062-03/S0002-9947-1947-0023996-1/S0002-9947-1947-0023996-1.pdf pdf]
==1950 ...==
* [[Richard E. Bellman]] ('''1953'''). ''[http://www.rand.org/pubs/reports/R245.html An Introduction to the Theory of Dynamic Programming]''. R-245, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]
* [[Richard E. Bellman]] ('''1954'''). ''The Theory of Dynamic Programming''. P-550, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [http://www.rand.org/content/dam/rand/pubs/papers/2008/P550.pdf pdf]
* [[Richard E. Bellman]] ('''1954'''). ''On a new Iterative Algorithm for Finding the Solutions of Games and Linear Programming Problems''. Technical Report P-473, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]
* [[Richard E. Bellman]] ('''1957'''). ''Dynamic Programming''. [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press]
* [[Richard E. Bellman]] ('''1957'''). ''The Theory of Games''. Technical Report P-1062, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]
* [[Richard E. Bellman]] ('''1957'''). ''Markovian decision processes''. Journal of Mathematics and Mechanics 38, 716–719
* [[Richard E. Bellman]] ('''1958'''). ''[http://www.sciencedirect.com/science/article/pii/S0019995858800030 Dynamic Programming and Stochastic Control Processes]''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA], [http://www.sciencedirect.com/science/journal/00199958/1/3 Information and Control 1], pp. 228–239
==1960 ...==
* [[Richard E. Bellman]] ('''1960'''). ''[http://dl.acm.org/citation.cfm?id=321011 Sequential Machines, Ambiguity, and Dynamic Programming]''. [[ACM#Journal|Journal of the ACM]], Vol. 7, No. 1
* [[Richard E. Bellman]], [[Mathematician#SEDreyfus|Stuart E. Dreyfus]] ('''1962'''). ''Applied Dynamic Programming''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press], [https://www.rand.org/content/dam/rand/pubs/reports/2006/R352.pdf pdf]
* [[Richard E. Bellman]] ('''1962'''). ''[http://dl.acm.org/citation.cfm?id=321111 Dynamic Programming Treatment of the Travelling Salesman Problem]''. [[ACM#Journal|Journal of the ACM]], Vol. 9, No. 1, [http://www.akira.ruc.dk/~keld/teaching/algoritmedesign_f08/Artikler/05/Bellman61.pdf 1961 pdf preprint]
* [[Richard E. Bellman]] ('''1965'''). ''[http://www.rand.org/pubs/papers/P3013/ On the Application of Dynamic Programming to the Determination of Optimal Play in Chess and Checkers].'' [https://en.wikipedia.org/wiki/Proceedings_of_the_National_Academy_of_Sciences_of_the_United_States_of_America PNAS]
* [[Richard E. Bellman]] ('''1969'''). ''[http://dl.acm.org/citation.cfm?id=1711252 Information science: A function is a mapping-plus a class of algorithms]''. [https://www.journals.elsevier.com/information-sciences/ Information Sciences], Vol. 1, No. 3
==1970 ...==
* [[Richard E. Bellman]], [http://dblp.uni-trier.de/pers/hd/g/Giertz:Magnus Magnus Giertz] ('''1973'''). ''On the Analytic Formalism of the Theory of Fuzzy Sets''. [https://www.journals.elsevier.com/information-sciences/ Information Sciences], Vol. 5 <ref>[https://en.wikipedia.org/wiki/Fuzzy_set Fuzzy set from Wikipedia]</ref>
==1980 ...==
* [[Richard E. Bellman]] ('''1984'''). ''[http://www.amazon.com/Eye-Hurricane-Autobiography-Richard-Bellman/dp/997196600X Eye of the Hurricane: an Autobiography]''. [https://en.wikipedia.org/wiki/World_Scientific World Scientific Publishing]
==2000 ...==
* [[Mathematician#SEDreyfus|Stuart E. Dreyfus]] ('''2002'''). ''Richard Bellman on the Birth of Dynamic Programming''. [https://en.wikipedia.org/wiki/Operations_Research:_A_Journal_of_the_Institute_for_Operations_Research_and_the_Management_Sciences Operations Research], Vol. 50, No. 1, [http://www.cas.mcmaster.ca/~se3c03/journal_papers/dy_birth.pdf pdf]
* [[Richard E. Bellman]] ('''2003'''). ''[http://dl.acm.org/citation.cfm?id=862270 Dynamic Programming]''. [https://en.wikipedia.org/wiki/Dover_Publications Dover Publications]
==2010 ...==
* [[Richard E. Bellman]] ('''2010'''). ''[http://press.princeton.edu/titles/9234.html Dynamic Programming]''. With a new introduction by [[Mathematician#SEDreyfus|Stuart E. Dreyfus]], [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press]
* [[Richard E. Bellman]], [[Mathematician#SEDreyfus|Stuart E. Dreyfus]] ('''2015'''). ''[http://press.princeton.edu/titles/100.html Applied Dynamic Programming]''. [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press]
=External Links=
* [https://en.wikipedia.org/wiki/Richard_E._Bellman Richard E. Bellman from Wikipedia]
* [http://www-history.mcs.st-andrews.ac.uk/Biographies/Bellman.html Bellman biography] by [http://www.numericana.com/fame/#o-connor John J. O'Connor] and [http://www.numericana.com/fame/#robertson Edmund F. Robertson]
* [http://www.ieeeghn.org/wiki/index.php/Richard_Bellman Richard Bellman - GHN: IEEE Global History Network]
* [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=12968 The Mathematics Genealogy Project - Richard Bellman]
* [https://en.wikipedia.org/wiki/Bellman_equation Bellman equation from Wikipedia]
* [https://en.wikipedia.org/wiki/Hamilton%E2%80%93Jacobi%E2%80%93Bellman_equation Hamilton–Jacobi–Bellman equation from Wikipedia]
* [https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm Bellman–Ford algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Bellman_pseudospectral_method Bellman pseudospectral method from Wikipedia]
* [http://www.bellmanequation.com/pages/about.html The Bellman Equation, Richard Bellman, The Movie] by [http://www.zennyrun.com/ Gabriel Leif Bellman]
: Bellman Equation Documentary Preview, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=FEzkGddibwc|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:richard_bellman.jpg|border|right|thumb|link=http://www.bellmanequation.com/pages/about.html| Richard E. Bellman <ref>[http://www.bellmanequation.com/pages/about.html The Bellman Equation, Richard Bellman, The Movie] by [http://www.zennyrun.com/ Gabriel Leif Bellman]</ref> ]]
'''Richard Ernest Bellman''', (August 26, 1920 – March 19, 1984) <br/>
was an American [https://en.wikipedia.org/wiki/Applied_mathematics applied mathematician] and inventor of [[Dynamic Programming|dynamic programming]] in 1953 while affiliated with [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]. Dynamic programming defines a mathematical theory devoted to the study of multistage processes. These processes are composed of sequences of operations in which the outcome of those preceding may be used to guide the course of future ones <ref>[[Richard E. Bellman]] ('''1953'''). ''[http://www.rand.org/pubs/reports/R245.html An Introduction to the Theory of Dynamic Programming]''. R-245, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]</ref>, an application in computer chess and games is the use of [[Transposition Table|transposition tables]] inside an [[Iterative Deepening|iterative deepening]] framework <ref>[https://en.wikipedia.org/wiki/Dynamic_programming#Algorithms_that_use_dynamic_programming Algorithms that use dynamic programming from Wikipedia]</ref>. He worked and published on [https://en.wikipedia.org/wiki/Markov_decision_process Markov decision processes], and in 1958, he published his first paper on [https://en.wikipedia.org/wiki/Stochastic_process stochastic control processes] <ref>[[Richard E. Bellman]] ('''1958'''). ''[http://www.sciencedirect.com/science/article/pii/S0019995858800030 Dynamic Programming and Stochastic Control Processes]''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA], [http://www.sciencedirect.com/science/journal/00199958/1/3 Information and Control 1], pp. 228–239</ref>, where he introduced what is today called the [https://en.wikipedia.org/wiki/Bellman_equation Bellman equation], also known as dynamic programming equation.
During [https://en.wikipedia.org/wiki/World_War_II World War II], Bellman worked in [[Los Alamos National Laboratory|Los Alamos]] on the [https://en.wikipedia.org/wiki/Manhattan_Project Manhattan project]. He received his Ph.D. at [https://en.wikipedia.org/wiki/Princeton_University Princeton] under the supervision of [https://en.wikipedia.org/wiki/Solomon_Lefschetz Solomon Lefschetz] in 1947, and since 1949 he worked for many years at RAND, and was professor at [[University of Southern California]] since 1965. In the 50s he was persecuted by [https://en.wikipedia.org/wiki/Joseph_McCarthy McCarthy] <ref>[http://www.bellmanequation.com/pages/about.html The Bellman Equation, Richard Bellman, The Movie] by [http://www.zennyrun.com/ Gabriel Leif Bellman]</ref> <ref>[https://en.wikipedia.org/wiki/McCarthyism McCarthyism from Wikipedia]</ref>.
=Retrograde Analysis=
The dynamic programming methodology which defined the field of [[Retrograde Analysis|retrograde endgame analysis]] was discovered by Bellman in 1965 <ref>[[Richard E. Bellman]] ('''1965'''). ''[http://www.rand.org/pubs/papers/P3013/ On the Application of Dynamic Programming to the Determination of Optimal Play in Chess and Checkers].'' Proceedings of the National Academy of Sciences of the United States of America</ref>. Bellman had considered [https://en.wikipedia.org/wiki/Game_theory game theory] from a classical perspective as well <ref>[[Richard E. Bellman]] ('''1954'''). ''On a new Iterative Algorithm for Finding the Solutions of Games and Linear Programming Problems''. Technical Report P-473, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], U. S. Air Force Project RAND, [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]</ref> <ref>[[Richard E. Bellman]] ('''1957'''). ''The Theory of Games''. Technical Report P-1062, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]</ref>, but his work came to fruition in his 1965 paper, where he observed that the entire [https://en.wikipedia.org/wiki/State_space_%28dynamical_system%29 state-space] could be stored and that dynamic programming techniques could then be used to compute whether either side could win any position <ref>[[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://www.msri.org/publications/books/Book29/files/stiller.pdf pdf]</ref>.
=Selected Publications=
<ref>[http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=01102791 List of Publications: Richard Bellman]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/b/Bellman:Richard.html DBLP: Richard Bellman]</ref>
==1947==
* [[Richard E. Bellman]] ('''1947'''). ''On the Boundedness of Solutions of Non-Linear Differential and Difference Equations''. Ph.D. thesis, [http://www.ams.org/journals/tran/1947-062-03/S0002-9947-1947-0023996-1/S0002-9947-1947-0023996-1.pdf pdf]
==1950 ...==
* [[Richard E. Bellman]] ('''1953'''). ''[http://www.rand.org/pubs/reports/R245.html An Introduction to the Theory of Dynamic Programming]''. R-245, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation]
* [[Richard E. Bellman]] ('''1954'''). ''The Theory of Dynamic Programming''. P-550, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [http://www.rand.org/content/dam/rand/pubs/papers/2008/P550.pdf pdf]
* [[Richard E. Bellman]] ('''1954'''). ''On a new Iterative Algorithm for Finding the Solutions of Games and Linear Programming Problems''. Technical Report P-473, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]
* [[Richard E. Bellman]] ('''1957'''). ''Dynamic Programming''. [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press]
* [[Richard E. Bellman]] ('''1957'''). ''The Theory of Games''. Technical Report P-1062, [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA]
* [[Richard E. Bellman]] ('''1957'''). ''Markovian decision processes''. Journal of Mathematics and Mechanics 38, 716–719
* [[Richard E. Bellman]] ('''1958'''). ''[http://www.sciencedirect.com/science/article/pii/S0019995858800030 Dynamic Programming and Stochastic Control Processes]''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Santa_Monica,_California Santa Monica, CA], [http://www.sciencedirect.com/science/journal/00199958/1/3 Information and Control 1], pp. 228–239
==1960 ...==
* [[Richard E. Bellman]] ('''1960'''). ''[http://dl.acm.org/citation.cfm?id=321011 Sequential Machines, Ambiguity, and Dynamic Programming]''. [[ACM#Journal|Journal of the ACM]], Vol. 7, No. 1
* [[Richard E. Bellman]], [[Mathematician#SEDreyfus|Stuart E. Dreyfus]] ('''1962'''). ''Applied Dynamic Programming''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND Corporation], [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press], [https://www.rand.org/content/dam/rand/pubs/reports/2006/R352.pdf pdf]
* [[Richard E. Bellman]] ('''1962'''). ''[http://dl.acm.org/citation.cfm?id=321111 Dynamic Programming Treatment of the Travelling Salesman Problem]''. [[ACM#Journal|Journal of the ACM]], Vol. 9, No. 1, [http://www.akira.ruc.dk/~keld/teaching/algoritmedesign_f08/Artikler/05/Bellman61.pdf 1961 pdf preprint]
* [[Richard E. Bellman]] ('''1965'''). ''[http://www.rand.org/pubs/papers/P3013/ On the Application of Dynamic Programming to the Determination of Optimal Play in Chess and Checkers].'' [https://en.wikipedia.org/wiki/Proceedings_of_the_National_Academy_of_Sciences_of_the_United_States_of_America PNAS]
* [[Richard E. Bellman]] ('''1969'''). ''[http://dl.acm.org/citation.cfm?id=1711252 Information science: A function is a mapping-plus a class of algorithms]''. [https://www.journals.elsevier.com/information-sciences/ Information Sciences], Vol. 1, No. 3
==1970 ...==
* [[Richard E. Bellman]], [http://dblp.uni-trier.de/pers/hd/g/Giertz:Magnus Magnus Giertz] ('''1973'''). ''On the Analytic Formalism of the Theory of Fuzzy Sets''. [https://www.journals.elsevier.com/information-sciences/ Information Sciences], Vol. 5 <ref>[https://en.wikipedia.org/wiki/Fuzzy_set Fuzzy set from Wikipedia]</ref>
==1980 ...==
* [[Richard E. Bellman]] ('''1984'''). ''[http://www.amazon.com/Eye-Hurricane-Autobiography-Richard-Bellman/dp/997196600X Eye of the Hurricane: an Autobiography]''. [https://en.wikipedia.org/wiki/World_Scientific World Scientific Publishing]
==2000 ...==
* [[Mathematician#SEDreyfus|Stuart E. Dreyfus]] ('''2002'''). ''Richard Bellman on the Birth of Dynamic Programming''. [https://en.wikipedia.org/wiki/Operations_Research:_A_Journal_of_the_Institute_for_Operations_Research_and_the_Management_Sciences Operations Research], Vol. 50, No. 1, [http://www.cas.mcmaster.ca/~se3c03/journal_papers/dy_birth.pdf pdf]
* [[Richard E. Bellman]] ('''2003'''). ''[http://dl.acm.org/citation.cfm?id=862270 Dynamic Programming]''. [https://en.wikipedia.org/wiki/Dover_Publications Dover Publications]
==2010 ...==
* [[Richard E. Bellman]] ('''2010'''). ''[http://press.princeton.edu/titles/9234.html Dynamic Programming]''. With a new introduction by [[Mathematician#SEDreyfus|Stuart E. Dreyfus]], [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press]
* [[Richard E. Bellman]], [[Mathematician#SEDreyfus|Stuart E. Dreyfus]] ('''2015'''). ''[http://press.princeton.edu/titles/100.html Applied Dynamic Programming]''. [https://en.wikipedia.org/wiki/Princeton_University_Press Princeton University Press]
=External Links=
* [https://en.wikipedia.org/wiki/Richard_E._Bellman Richard E. Bellman from Wikipedia]
* [http://www-history.mcs.st-andrews.ac.uk/Biographies/Bellman.html Bellman biography] by [http://www.numericana.com/fame/#o-connor John J. O'Connor] and [http://www.numericana.com/fame/#robertson Edmund F. Robertson]
* [http://www.ieeeghn.org/wiki/index.php/Richard_Bellman Richard Bellman - GHN: IEEE Global History Network]
* [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=12968 The Mathematics Genealogy Project - Richard Bellman]
* [https://en.wikipedia.org/wiki/Bellman_equation Bellman equation from Wikipedia]
* [https://en.wikipedia.org/wiki/Hamilton%E2%80%93Jacobi%E2%80%93Bellman_equation Hamilton–Jacobi–Bellman equation from Wikipedia]
* [https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm Bellman–Ford algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Bellman_pseudospectral_method Bellman pseudospectral method from Wikipedia]
* [http://www.bellmanequation.com/pages/about.html The Bellman Equation, Richard Bellman, The Movie] by [http://www.zennyrun.com/ Gabriel Leif Bellman]
: Bellman Equation Documentary Preview, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=FEzkGddibwc|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one level]]'''
