Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/92212
Название: Optimization of complex functions and the algorithm for exact geometric search for complex roots of a polynomial
Авторы: Trofimov, S. P.
Дата публикации: 2018
Издатель: Elsevier B.V.
Библиографическое описание: Trofimov S. P. Optimization of complex functions and the algorithm for exact geometric search for complex roots of a polynomial / S. P. Trofimov. — DOI 10.1016/j.ifacol.2018.11.433 // IFAC-PapersOnLine. — 2018. — Vol. 32. — Iss. 51. — P. 883-888.
Аннотация: The paper describes an application for visualization of four-dimensional graphs of a complex variable function. This application allowed us to construct an exact geometric algorithm for finding the real and complex roots of a polynomial on the same plane. A graph of an n-th order polynomial on the real plane allows us to define geometrically all the real roots. Number of real roots varies from 0 to n. The rest of the roots are complex and not determined by the graph. In the article, in addition to the graph of the basic polynomial, two auxiliary graphs are constructed, which allow us to represent all complex roots on the same real plane. Realization of this method is considered in detail for the solution of a cubic polynomial. In this case the method has exceptional features in comparison with polynomials of other degrees. We also propose an algorithm for constructing auxiliary functions for the general case of a polynomial of order n which have exact formulas for polynomials with order n ≤ 10. The algorithm for the first time builds the exact hodograph of poles for the control systems with feedback. We generalize the concepts of stationary and extremal points to the case of a complex function. The absence of the possibility of comparing the complex values of the objective function is compensated by an analysis of the behavior of the stationary point under small perturbations of the polynomial by linear functions. Optimality criteria are proposed using complex trajectories of stationary points. © 2018
Ключевые слова: COMPLEX FUNCTION
EXACT ALGORYTHM
EXTREMAL POINT
GRAPH
OPTIMALITY CRITERION
POLYNOM
ROOT HODOGRAPH
ROOTS
STATIONARY POINT
FLIGHT CONTROL SYSTEMS
KINEMATICS
COMPLEX FUNCTIONS
EXACT ALGORYTHM
EXTREMAL
GRAPH
HODOGRAPHS
OPTIMALITY CRITERIA
POLYNOM
ROOTS
STATIONARY POINTS
POLYNOMIALS
URI: http://elar.urfu.ru/handle/10995/92212
Условия доступа: info:eu-repo/semantics/openAccess
Идентификатор SCOPUS: 85058238662
Идентификатор WOS: 000453278300165
Идентификатор PURE: 8423234
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.11.433
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
10.1016-j.ifacol.2018.11.433.pdf782,2 kBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.