A method to accelerate the computation of successive approximation

Cheng-Yuan Ku*, Yi Wen Chang, Chun Wei Kuo

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Dynamic programming (DP) method has become one of the most popular tools for formulating, analyzing and optimizing a problem with stochastic characteristic. However, time-consuming computation for optimal results emerges while handling the large-size state space. This paper proposes a simple method to speed up the successive approximation for dynamic programming. The single window and double window approaches are presented and a two-queue stochastic model is chosen to test the effectiveness. Compared with original successive approximation, the numerical results show that the observing window methods indeed decrease the computational effort and the double window method is more efficient than the single window. Moreover, we also draw the conclusion that the better-chosen initial values would enhance the performance of DP processing.

Original languageEnglish
Pages (from-to)326-331
Number of pages6
JournalAdvanced Science Letters
Issue number1
StatePublished - 1 Sep 2012


  • Acceleration of computation
  • Dynamic programming
  • Successive approximation


Dive into the research topics of 'A method to accelerate the computation of successive approximation'. Together they form a unique fingerprint.

Cite this