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.

Number of issue
8
Language
English
Pages
1373-1381
Status
Published
Volume
56
Year
2016
Organizations
  • 1 RUDN University, ul. Miklukho-Maklaya 6, Moscow, 117198, Russian Federation
Keywords
computational algorithm; covering constant of a linear operator; linear inequalities in metric space
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/3856/
Share

Other records