1,359
edits
Changes
Jump to navigation
Jump to search
Line 24:
Line 24: − + − + + + + Line 34:
Line 37: + + + + + +
Numerical Analysis of Interference Patterns (view source)
Revision as of 17:55, 19 September 2007
, 17:55, 19 September 2007→parSA
== Simulated Annealing ==
== Simulated Annealing ==
=== parSA ===
=== ParSA ===
[http://www.phys.uconn.edu/~demas/diamonds/parSA1/ParSALibDoc.pdf]
Here [http://www.phys.uconn.edu/~demas/diamonds/parSA1/ParSALibDoc.pdf] is the link the the ParSA documentation.
The ParSA (Parallel Simulated Annealing) library is a set of classes written in C++ that can be used to solve optimization problems via a process know as simulated annealing.
The ParSA library contains many different types of
The Equation for convergence speed is:
The Equation for convergence speed is:
<math>P\left(X_n \notin Cost_{min}\right) \approx \left(\frac{K}{n}\right)^\alpha</math>
<math>P\left(X_n \notin Cost_{min}\right) \approx \left(\frac{K}{n}\right)^\alpha</math>
|align="center" width="80"|(1)
|align="center" width="80"|(1)
|}
{|width="50%"
|align="right"|
<math>T=\bar{\Delta C^{(|)}\left(\ln{\frac{m_2}{m_2\chi_0-(1-\chi_0)m_1}\right)^{-1}</math>
|align="center" width="80"|(2)
|}
|}