The PCGrate
^{®}S(X) v.6.56.6 32/64bit series toolkit, which is designed for exact efficiency modeling of relief & phase diffraction gratings and rough mirrors, combines the brilliant performance of the earlier implementations of PCGrates with the modern Graphical User Interface with 3D & 2D Open GL plots and expands noticeably the set of supported features including two different solvers, paralleling, and the capability to calculate data from the command line using XMLformat input/output files. With PCGrateS(X) v.6.56.6 32/64bit series software one can simulate rigorously effects of scattering in periodical and nonperiodical structures having multilayer micro/nanoroughnesses of various nature, design variablegroovedepth (VGD) & variablelinespaced (VLS) multisection gratings, model gratings covered with very thin or/and thick layers having arbitrary profiled borders including real & nonfunction ones, calculate photonic crystals & aspherical gratings, and work with conical mountings & nonplanar incident waves including Gaussian ones as well as with a general polarization state.
PCGrate®S(X) v. 6.6 32/64bit software has many adds and improvements in comparison with v. 6.5. The new optical mounting (“Fix Focus”) and relevant photon energy unit (“eV”) were added to this version. Fix Focus is an optical mount configuration for a reflected order where the reflected order is observed at a fixed ratio c of polar diffraction and incidence angle cosines that is used at xray–EUV synchrotron radiation sources in plane grating focusing monochromators. In version 6.6, the “E(1) refl” and the “E(1) trans” buttons were added to quickly plot efficiency of reflected/transmitted order #1 graphs. If there are multiple suitable scanning parameters, then an additional dialog appears and you have to choose one. Conical diffraction algorithms to predict reflection grating efficiencies in short waves were substantially improved.
A lot of minor changes were implemented both in the v. 6.6 code and the documentation.
The PCGrate®S(X) v.6.1 32bit Series toolkit combines the superb performance of earlier implementations of the PCGrates with a modern GUI that has 3D&2D OpenGL plots and extends appreciably the set of supported features such as paralleling and the calculation of grating efficiency from the command line using XMLformat input/output files. The PCGrateS(X) v.6.1 Series software makes it possible to simulate the effect of microroughness and interdiffusion (i.e. random scattering in the multilayers), to model gratings covered with thin or/and very thick layers of arbitrary shape, to calculate aspherical gratings, and to work with conical mountings and nonplanar incident waves as well as with a general polarization state.
The Limits and Constraints of DEMOs of the PCGrate^{®}S(X)™ Software
The Demo versions of PCGrateS(X) v.6.1 32bit Complete and PCGrateS(X) v.6.56.6 32/64bit Complete have several restrictions.
Table. Key parameter possible values for Demos
Maximal number of layers

Maximal number of points per boundary

Wavelength

Diffraction orders range

Number of plane waves & plane sections

Maximal thicknesstoperiod ratio

GUI & XML output formats

Nearzone field output

3

100

From xrays to meters

±40

3 × 3

0.25

Yes

Yes

Hardware Requirements of the PCGrate Demos Complete
The PCGrate Demo v.6.1 32bit and v.6.56.6 32/64bit for Microsoft^{®} Windows^{®} 32/64bit requires:
Microsoft^{®} Windows^{®} 2K/XP/Server 2003/Vista/Server 2008/7 or higher installed.
PCcompatible single or multicore/processor computer.
At least 64 MB of free RAM.
Minimum 50 MB of free hard disk space.
Web and email access for technical support and program updates.
A Brief Overview
The optimization algorithm "HCP Solver" is an approximate polynomial algorithm with O(1.5N^{3}). It is based on the concept of successive iterative decreases in cycle length, in which the iterative procedure begins with a randomly chosen cycle. As different edges of the graph are assigned the weights 0 and 1, the cycle length is determined in view of the edges with the unit weight. Each iteration is completed by replacement of several edges in the cycle. In this case the cycle length either decreases or remains unchanged. A Hamiltonian cycle in the graph exists if its length is equal to zero (H = 0). The graphical viewer for graphs and the generator of leaper graphs stored in TSPLIBformat (*.hcp) are included in the package.
A Brief Overview
The TSMP1 (Traveling SalesMan Problem) code is intended for solving the problem of the precise determination of the length and path of a minimal Hamiltonian cycle (cycles) of a weighed network (the Traveling Salesman Problem, the TSP) in a time that polynomially depends on the network's dimension (the number of its nodes); and it also relates to the construction (on this basis) of algorithms of polynomial complexity to solve socalled NPcomplete problems of discrete mathematics. The essence of this problem is as follows: to find in a network given a cycle sequence of passing the edges in such a way that it includes all the nodes of the network one and only one time (i.e. the passage of the edges is a Hamiltonian cycle), and the sum of the edge weights of the cycle under consideration (the length of the cycle) is minimal among all possible cycles of the network (at least not greater than the length of any other cycles having similar properties). The research program including the source code and documentation can be obtained from this page (TSMP1.zip file). Input and output files from TSPLIB – Gerd Reinelt's library of TSP instances – are included in the package.
Hardware Requirements of the HCP and TSMP Solvers
The HCP v. 1.0 and TSMP1 v. 1.0 software for Microsoft^{®} Windows^{®} 32/64bit require:
Microsoft^{®} Windows^{®} 95Server 2008 or higher installed.
PCcompatible (Pentium^{®} or higher for better performance) singleprocessor computer.
At least 64 MB of free RAM.
Minimum 10 MB of free hard disk space.
Web and email access for technical support and program updates.