Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/90098
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorChentsov, A. G.en
dc.contributor.authorPytkeev, E. G.en
dc.date.accessioned2020-09-29T09:45:59Z-
dc.date.available2020-09-29T09:45:59Z-
dc.date.issued2019-
dc.identifier.citationChentsov, A. G. Constraints of asymptotic nature and attainability problems / A. G. Chentsov, E. G. Pytkeev. — DOI 10.20537/vm190408 // Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki. — 2019. — Vol. 4. — Iss. 29. — P. 569-582.en
dc.identifier.issn1994-9197-
dc.identifier.otherhttp://www.mathnet.ru/php/getFT.phtml?jrnid=vuu&paperid=702&what=fullt&option_lang=engpdf
dc.identifier.other1good_DOI
dc.identifier.other83378d84-3859-4c8f-a6af-2c08099384b5pure_uuid
dc.identifier.otherhttp://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=85081625616m
dc.identifier.urihttp://elar.urfu.ru/handle/10995/90098-
dc.description.abstractIn control problems, construction and investigation of attainability domains and their analogs are very important. This paper addresses attainability problems in topological spaces. Constraints of asymptotic nature defined in the form of nonempty families of sets are used. The solution of the corresponding attainability problem is defined as an attraction set. Points of this attraction set (attraction elements) are realized in the class of approximate solutions which are nonsequential analogs of the Warga approximate solutions. Some possibilities of applying compactifiers are discussed. Questions of the realization of attraction sets up to a given neighborhood are considered. Some topological properties of attraction sets are investigated. An example with an empty attraction set is considered. © 2019 Udmurt State University. All rights reserved.en
dc.description.sponsorshipRussian Foundation for Basic Research, RFBR: 19–01–00573en
dc.description.sponsorshipFunding. Research was funded by the Russian Foundation for Basic Research, project number 19–01–00573.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherUdmurt State Universityen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceVestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Naukien
dc.subjectATTRACTION SETen
dc.subjectCOMPACTNESSen
dc.subjectEXTENSIONen
dc.subjectTOPOLOGICAL SPACEen
dc.titleConstraints of asymptotic nature and attainability problemsen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.rsi41752948-
dc.identifier.doi10.20537/vm190408-
dc.identifier.scopus85081625616-
local.affiliationN.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620219, Russian Federationen
local.affiliationUral Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federationen
local.contributor.employeeChentsov, A.G., N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620219, Russian Federation, Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federationru
local.contributor.employeePytkeev, E.G., N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620219, Russian Federation, Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russian Federationru
local.description.firstpage569-
local.description.lastpage582-
local.issue29-
local.volume4-
dc.identifier.wos000507854800008-
local.identifier.pure12015367-
local.identifier.eid2-s2.0-85081625616-
local.fund.rffi19-01-00573-
local.identifier.wosWOS:000507854800008-
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
10.20537-vm190408.pdf235,47 kBAdobe PDFПросмотреть/Открыть


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