Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 78 of 219 found articles
 
 
  DYNAMIC PROGRAMMING, REDUCTION OF DIMENSIONALITY AND MATRIX EIGENVALUE COMPUTATIONS
 
 
Title: DYNAMIC PROGRAMMING, REDUCTION OF DIMENSIONALITY AND MATRIX EIGENVALUE COMPUTATIONS
Author: Wong, Man Lam
Ng, Kevin Y. K.
Appeared in: Engineering optimization
Paging: Volume 20 (1993) nr. 4 pages 241-259
Year: 1993-02-01
Contents: This paper is a continuation of earlier papers by Ng & Sancho for solving certain dynamic programming problems, An iterative algorithm, based on a priori deduction from Bellman's principle of optimality, is developed. The technique is applied to evaluate the smallest eigenvalue of positive definite symmetric matrices. It is shown to use only minimal storage requirements as compared to the traditional dynamic programming approach. Solutions on test matrices compare favorably in accuracy and convergence speed with other numerical solutions. The significance of the method is that it provides a means of reducing Bellman's “curse of dimensionality” and broadens the scope of problems that can effectively be solved with the dynamic programming approach
Publisher: Taylor & Francis
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 78 of 219 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands