Cover: Dynamic Programming, Invariant Imbedding, and Thin Beam Theory.

Dynamic Programming, Invariant Imbedding, and Thin Beam Theory.

Published 1968

by D. W. Alspaugh, H. H. Natsuyama, Robert E. Kalaba

Purchase Print Copy

 Format Price
Add to Cart Paperback26 pages $20.00

Dynamic programming and invariant imbedding concepts are used to transform the two-point boundary-value problem of the theory of thin beams into initial-value problems that can be solved effectively by analog or digital computers. To demonstrate the computational feasibility of the methods, an example of a uniform beam of unit length, free at the left end and cantilevered at the right, was chosen, and the deflection was computed by three methods: a reference solution was computed by a segmenting technique, and the deflections were then computed by dynamic programming and by invariant imbedding. Results indicate excellent agreement among the various solutions. 26 pp. Ref.

This report is part of the RAND research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.