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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

S. E. Zhukovskiy

RUDN University

Author for correspondence.
Email: s-e-zhuk@yandex.ru
Russian Federation, ul. Miklukho-Maklaya 6, Moscow, 117198

Z. T. Zhukovskaya

RUDN University

Email: s-e-zhuk@yandex.ru
Russian Federation, ul. Miklukho-Maklaya 6, Moscow, 117198

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Ltd.