Optimized feed-forward neural-network algorithm trained for cyclotron-cavity modeling
- 1. Energy Engineering and Physics Department, Amirkarbir University of Technology, Tehran (Iran, Islamic Republic of)
- 2. College of Information and Communication Engineering, Sungkyunkwan University, Suwon (Korea, Republic of)
Description
The cyclotron cavity presented in this paper is modeled by a feed-forward neural network trained by the authors' optimized back-propagation (BP) algorithm. The training samples were obtained from simulation results that are for a number of defined situations and parameters and were achieved parametrically using MWS CST software; furthermore, the conventional BP algorithm with different hidden-neuron numbers, structures, and other optimal parameters such as learning rate that are applied for our purpose was also used here. The present study shows that an optimized FFN can be used to estimate the cyclotron-model parameters with an acceptable error function. A neural network trained by an optimized algorithm therefore shows a proper approximation and an acceptable ability regarding the modeling of the proposed structure. The cyclotron-cavity parameter-modeling results demonstrate that an FNN that is trained by the optimized algorithm could be a suitable method for the estimation of the design parameters in this case. (authors)
Additional details
Identifiers
Publishing Information
- Journal Title
- Chinese Physics. C, High Energy Physics and Nuclear Physics
- Journal Volume
- 41
- Journal Issue
- 1
- Journal Page Range
- [7 p.]
- ISSN
- 1674-1137
INIS
- Country of Publication
- China
- Country of Input or Organization
- China
- INIS RN
- 52020404
- Subject category
- S43: PARTICLE ACCELERATORS;
- Descriptors DEI
- ALGORITHMS; APPROXIMATIONS; COMPUTER CODES; CYCLOTRONS; DESIGN; ERRORS; NEURAL NETWORKS; SIMULATION; TRAINING
- Descriptors DEC
- ACCELERATORS; CALCULATION METHODS; CYCLIC ACCELERATORS; EDUCATION; MATHEMATICAL LOGIC
Optional Information
- Notes
- 6 figs., 3 tabs., 19 refs.; http://dx.doi.org/10.1088/1674-1137/41/1/017003