Research Article
A Derivative-Free Mesh Optimization Algorithm for Mesh Quality Improvement and Untangling
Algorithm 1
Downhill simplex algorithm.
| Compute the reflected point, and function value at this point, | | . There are 3 possibilities: | | Case 1 (reflection): | | if then | | replace by . | | end if | | Case 2 (expansion): | | if then | | compute the expansion point, and evaluate . | | if then | | replace by . | | else | | replace by . | | end if | | end if | | Case 3 (contraction): | | if then | | compute the contraction point, and evaluate . | | if then | | replace by . | | else | | replace by (1/2)() for | | end if | | end if |
|
