Difference between revisions of "Numerical Analysis of Interference Patterns"
Jump to navigation
Jump to search
(→parSA) |
(→parSA) |
||
| Line 24: | Line 24: | ||
== Simulated Annealing == | == Simulated Annealing == | ||
| − | === | + | === 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: | ||
| Line 34: | Line 37: | ||
<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) | ||
|} | |} | ||
Revision as of 17:55, 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) |
|
Failed to parse (syntax error): {\displaystyle T=\bar{\Delta C^{(|)}\left(\ln{\frac{m_2}{m_2\chi_0-(1-\chi_0)m_1}\right)^{-1}} |
(2) |