Dynamic programming and Gaussian elimination.
Expert InsightsPublished 1960
An extension to P-917, On Some Applications of Dynamic Programming to Matrix Theory, which demonstrates that the functional technique of dynamic programming leads to an algorithm for solving linear equations when the matrix is a Jacobi matrix. This paper shows that the algorithm is essentially the same as Gaussian elimination.
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1960
- Pages: 7
- DOI: https://doi.org/10.7249/pubs
- Document Number: P-1906
Citation
RAND Style Manual
Chicago Manual of Style
This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
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.