1,359
edits
Changes
Jump to navigation
Jump to search
Line 44:
Line 44: − + − explanation goes here − − === ParSA === − − 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: − − {|width="50%" − |align="right"| − − |align="center" width="80"|(1) − |} − − Where ''K'' and <math>\alpha</math> are problem specific constants and <math>X_n</math> is a solution of length ''n''. Using equation (1) and test runs on smaller problems of lower order, ''K'' and <math>\alpha</math> can be determined. Along with some suggestions provided in the ParSA documentation, progress can be made towards finding higher quality solutions at a much faster rate. − − {|width="50%" − |align="right"| − <math>\ln P = \alpha \left(\ln K - \ln n\right)</math> − |align="center" width="80"|(2) − |} − − − The equation for warming temperature in the Aarts scheduler: − − {|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"|(3) − |} − − === Table of Proposed Runs === − − <u>Clustering</u> − − SA Clustering Solver − − Clustering Scheduler − * SA Aarts − * SA Easy Scheduler − − <u>Multiple Independent Runs (M.I.R.)</u> − − MIR_Solver − − MIR_Scheduler − − − Use Combinations of the Different Solver/Scheduler Classes
Numerical Analysis of Interference Patterns (view source)
Revision as of 19:01, 17 October 2007
, 19:01, 17 October 2007→Simulated Annealing
== Simulated Annealing ==
== Simulated Annealing ==
<font color="red"> More to come on this subject! </font>
<math>P\left(X_n \notin Cost_{min}\right) \approx \left(\frac{K}{n}\right)^\alpha</math>
== References ==
== References ==