Reducing inverse systems of monomorphisms
G. R. Gordh Jr., Sibe Mardešić (1975)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
G. R. Gordh Jr., Sibe Mardešić (1975)
Colloquium Mathematicae
Similarity:
Weidong Gao, Alfred Geroldinger, David J. Grynkiewicz (2010)
Acta Arithmetica
Similarity:
Fernando Pablos Romo (2022)
Czechoslovak Mathematical Journal
Similarity:
The aim of this note is to offer an algorithm for studying solutions of infinite linear systems associated with group inverse endomorphisms. As particular results, we provide different properties of the group inverse and we characterize EP endomorphisms of arbitrary vector spaces from the coincidence of the group inverse and the Moore-Penrose inverse.
R. Duda (1971)
Colloquium Mathematicae
Similarity:
I. Lončar (1986)
Matematički Vesnik
Similarity:
I. Lončar (1990)
Matematički Vesnik
Similarity:
Romanov, V.G. (2004)
Sibirskij Matematicheskij Zhurnal
Similarity:
Kim, In-Jae, Shader, Bryan L. (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Nataliya Protsakh (2017)
Open Mathematics
Similarity:
In the paper the conditions of the existence and uniqueness of the solution for the inverse problem for higher order ultraparabolic equation are obtained. The equation contains two unknown functions of spatial and time variables in its right-hand side. The overdetermination conditions of the integral type are used.
Xiaoguang Yang (2010)
RAIRO - Operations Research
Similarity:
For a given partial solution, the partial inverse problem is to modify the coefficients such that there is a full solution containing the partial solution, while the full solution becomes optimal under new coefficients, and the total modification is minimum. In this paper, we show that the partial inverse assignment problem and the partial inverse minimum cut problem are NP-hard if there are bound constraints on the changes of coefficients.