Difference between revisions of "Numerical Analysis of Interference Patterns"
(→ParSA) |
(→ParSA) |
||
| Line 40: | Line 40: | ||
|} | |} | ||
| − | Where ''K'' and <math>\alpha</math> are problem specific constants and <math>X_n</math> is a solution of length ''n'' | + | 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: | The equation for warming temperature in the Aarts scheduler: | ||
| Line 47: | Line 54: | ||
|align="right"| | |align="right"| | ||
<math>T=\bar{\Delta C^{(|)}}\left(\ln \frac{m_2}{m_2\chi_0-(1-\chi_0)m_1}\right)^{-1}</math> | <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"|( | + | |align="center" width="80"|(3) |
|} | |} | ||
Revision as of 18:44, 19 September 2007
This page is currently a work in progress.
Phase Shifting Technique
- requires three phase shifted fringe patterns
- the phase shift must be known
- carefully controlled conditions must be maintained
Fourier Analysis Method
- requires carrier frequency, narrow frequency, low noise and open fringes
- estimates the phase wrapped (via arctan)
Phase-Locked Loop Algorithm
- computer simulated oscillator (VCO) needed
- phase error b/w the fringe pattern and the VCO vanishes
Artificial Neural Network Method
- requires carrier phase
- non-algorithmic (i.e. must have learning phase)
- types of learning include: supervised, unsupervised and reinforcement
- multi-layer: input, output, hidden neurons present
Genetic Algorithm
Simulated Annealing
ParSA
Here [1] 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:
|
|
(1) |
Where K and are problem specific constants and is a solution of length n. Using equation (1) and test runs on smaller problems of lower order, K and 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.
|
|
(2) |
The equation for warming temperature in the Aarts scheduler:
|
|
(3) |