2000SIAM Journal on Matrix Analysis and ApplicationsRequires access

Moore--Penrose Inverse of Matrices on Idempotent Semirings

Sukanta Pati

Open publisher page 9 citations

Abstract

We characterize matrices over an idempotent semiring satisfying some additional necessary conditions for which the Moore--Penrose inverse exists. The "(max,×) semiring," defined as the set of nonnegative real numbers ${\mathbb R}^+,$ equipped with the operations $a\oplus b= \max\{a,b\}\ \mbox{and}\ a\otimes b= ab$ is an example of such a semiring. The "(max,×) semiring,"', defined as the set of real numbers including $-\ity,$ equipped with the operations $a\oplus b= \max\{a,b\}\ \mbox{and}\ a\otimes b= a+b$ is another example. Some of our results generalize known results in the case of the binary boolean algebra (a trivial idempotent semiring). We give an algorithm to compute the Moore--Penrose inverse, when it exists. We also make comparisons with similar results over the conventional algebra.

About this research paper

What this paper is about

We characterize matrices over an idempotent semiring satisfying some additional necessary conditions for which the Moore--Penrose inverse exists. The "(max,×) semiring," defined as the set of nonnegative real numbers ${\mathbb R}^+,$ equipped with the operations $a\oplus b= \max\{a,b\}\ \mbox{and}\ a\otimes b= ab$ is an example of such a semiring. The "(max,×) semiring,"', defined as the set of real numbers including $-\ity,$ equipped with the operations $a\oplus b= \max\{a,b\}\ \mbox{and}\ a\otimes b= a+b$ is another example. Some of our results generalize known results in the case of the binary boolean algebra (a trivial idempotent semiring). We give an algorithm to compute the Moore--Penrose inverse, when it exists. We also make comparisons with similar results over the conventional algebra.

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We characterize matrices over an idempotent semiring satisfying some additional necessary conditions for which the Moore--Penrose inverse exists. The "(max,×) semiring," defined as the set of nonnegative real numbers ${\mathbb R}^+,$ equipped with the operations $a\oplus b= \max\{a,b\}\ \mbox{and}\ a\otimes b= ab$ is an example of such a semiring. The "(max,×) semiring,"', defined as the set of real numbers including $-\ity,$ equipped with the operations $a\oplus b= \max\{a,b\}\ \mbox{and}\ a\otimes b= a+b$ is another example. Some of our results generalize known results in the case of the binary boolean algebra (a trivial idempotent semiring). We give an algorithm to compute the Moore--Penrose inverse, when it exists. We also make comparisons with similar results over the conventional algebra.

Key concepts: Semiring, Idempotence, Mathematics, Combinatorics, Inverse, Kleene algebra, Idempotent matrix, Binary operation

Related papers

Back to paper searchBrowse research topicsOriginal source
Moore--Penrose Inverse of Matrices on Idempotent Semirings — Research Paper | ScholarLens