Displaying similar documents to “Note on the core matrix partial ordering”

Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem

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.

Explicit solutions of infinite linear systems associated with group inverse endomorphisms

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.

The vector cross product from an algebraic point of view

Götz Trenkler (2001)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

The usual vector cross product of the three-dimensional Euclidian space is considered from an algebraic point of view. It is shown that many proofs, known from analytical geometry, can be distinctly simplified by using the matrix oriented approach. Moreover, by using the concept of generalized matrix inverse, we are able to facilitate the analysis of equations involving vector cross products.