Richard Bellman American mathematician Date of Birth: 26.08.1920 Country: USA

Biography of Richard Bellman

Richard Ernest Bellman was born on August 26, 1920, in New York City, to a Jewish family with Polish and Russian roots. His mother, Pearl Safian, and his father, John James Bellman, owned a small grocery store on Bergen Street, near Prospect Park in Brooklyn. Richard attended Abraham Lincoln High School and went on to study mathematics at Brooklyn College, where he received his bachelor's degree in 1941. He then obtained his master's degree from the University of Wisconsin-Madison.

During World War II, Bellman worked in theoretical physics at Los Alamos. In 1946, he earned his Ph.D. in Princeton University. Starting from 1949, Bellman worked as a research scientist at RAND Corporation, where he developed dynamic programming, a method for solving complex problems by breaking them down into simpler subproblems. Later in his life, Richard began to attach special importance to biology and medicine, which he defined as "new areas of modern science".

In 1967, he founded and became the editor of the journal "Mathematical Biosciences," which specialized in publishing applied research on mathematics for medical and biological purposes. In 1973, Bellman was diagnosed with brain cancer and underwent surgery, leaving him with severe disabilities. He became a professor at the University of Southern California and a member of the American Academy of Arts and Sciences in 1975, the National Academy of Engineering in 1977, and the National Academy of Sciences in 1983.

Bellman was awarded the IEEE Medal of Honor in 1979 for his contributions to the theory of decision processes and control systems, specifically for his creation and application of dynamic programming. His key work was the "Bellman equation," or as it is also known, the equation of dynamic programming. This equation serves as a sufficient condition for optimality associated with the mathematical optimization method known as dynamic programming. Almost any problem that can be solved using optimal control theory can be approached by analyzing the corresponding Bellman equation.

The Bellman-Ford algorithm, sometimes referred to as the label-correcting algorithm, is a shortest path algorithm for weighted graphs that allows edges with negative weights. For graphs without negative-weight edges, Dijkstra's algorithm is usually used. Richard E. Bellman passed away on March 19, 1984, in Los Angeles, California.