Algorithm for computing the covering constant of a linear operator on a cone

An algorithm for computing the covering constant for the restriction of a linear operator to a cone defined by a finite set of inequalities is proposed. After a finite number of steps, the algorithm reduces the original problem to one of finding the eigenvalues of linear operators. © 2016, Pleiades Publishing, Ltd.

Авторы
Номер выпуска
8
Язык
Английский
Страницы
1373-1381
Статус
Опубликовано
Том
56
Год
2016
Организации
  • 1 RUDN University, ul. Miklukho-Maklaya 6, Moscow, 117198, Russian Federation
Ключевые слова
computational algorithm; covering constant of a linear operator; linear inequalities in metric space
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/3856/
Поделиться

Другие записи