Volume 5 Number 2 (Feb. 2010)
Home > Archive > 2010 > Volume 5 Number 2 (Feb. 2010) >
JCP 2010 Vol.5(2): 178-185 ISSN: 1796-203X
doi: 10.4304/jcp.5.2.178-185

Algorithm Dynamics Analysis Method

Peng Wang
Parallel Computing Laboratory, Chengdu University of Information Technology, Chengdu, China; University of Electronic Science & Technology of China, Chengdu, China

Abstract—The concepts of algorithm dynamics are proposed. Simulated annealing algorithm is analyzed by algorithm dynamics method. In the optimization progress metropolis criteria acts as an important role to construct simulated annealing algorithm. The metropolis criteria leads algorithm system to the ground state. At high temperature metropolis criteria make the algorithm system move like free particles, in this stage classic thermodynamics is suitable to analyze the algorithm. At low temperature metropolis criteria restricts the algorithm system vibration in the local area like crystal lattice vibration, in this stage quantum theory is suitable to analyze the algorithm. According to quantum dynamics the solution’s distribution of algorithm is Gaussian function. This results can interpret the implicit parallelism of algorithm. Uncertainty principle of algorithm (UPA) is proposed based on algorithm dynamics too. It indicates that precision and implicit parallelism of algorithm can’t achieve at the same time. Finally computational complexity is analyzed by thermodynamics. This method can get the lower bound of the algorithm easily. The computational complexity of sort problem’s lower bound is analyzed by thermodynamics method. The computational complexity is decided only by initial state and final state of the problems. The algorithm’s details are needless in this method.

Index Terms—algorithm dynamics, simulated annealing algorithm, implicit parallelism, quantum mechanics, thermodynamics, uncertainty principle of algorithm

[PDF]

Cite: Peng Wang, " Algorithm Dynamics Analysis Method," Journal of Computers vol. 5, no. 2, pp. 178-185, 2010.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Read more>>