Some Applications of Polynomial Approximation to Dynamic Programming
Download eBook for Free
|PDF file||1.2 MB||
Use Adobe Acrobat Reader version 10 or higher for the best experience.
Purchase Print Copy
|Add to Cart||Paperback58 pages||$23.00||$18.40 20% Web Discount|
An investigation of two polynomial approximation techniques: subregional approximation of a function by low-order Legendre polynomials over sufficiently small subdivisions of the original region of definition; and approximating a function by Chebychev polynomials over the whole region of definition. Numerical results were obtained from FORTRAN programs applying these techniques to allocation and bang-bang control problems.
This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation 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.
The RAND Corporation 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.