Abstract

In synthesis of magnetic elements and devices using the directed graph. The solution of the optimization problem on the basis of an optimal topological model of magnetic elements. For solve optimization problems use by the dynamical programming model.

Highlights

  • The given synthesis method as a cut-and-try method and successive approximation is very complicated and timeconsuming

  • Optimal calculation is not always ensured since the calculation methods used in the synthesis of magnetic elements and devices are approximate and require continuous adjustments and experimental verification of the calculated data that increases the cost of synthesis magnetic devices with significant labor and time costs

  • We consider the solution of the optimization problem on the basis of construction of the algorithm of an optimal topological model of magnetic elements with mathematical illustration of one of the variation methods, by the dynamical programming model, and this is very expedient [3]

Read more

Summary

INTRODUCTION

The given synthesis method as a cut-and-try method and successive approximation is very complicated and timeconsuming. Optimal calculation is not always ensured since the calculation methods used in the synthesis of magnetic elements and devices are approximate and require continuous adjustments and experimental verification of the calculated data that increases the cost of synthesis magnetic devices with significant labor and time costs. In the synthesis of magnetic elements, it is usually sought to ensure that it was simple and reliable as possible with minimum expenses, overall dimensions and weight. In practice an increase in reliability of magnetic elements and devices is associated with a complication and a simplification with the detrition of some quality indicators. It is impossible to construct optimal magnetic devices according to all contradictory criteria

ANALYSIS METHOD
CALCULATION ALGORITHM
ANALYSIS RESULTS
The given chosen arch with weight equal to 1 entering the vertex
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.