Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1809.07017

On reverse-order law of tensors and its application to additive results on Moore-Penrose inverse

Krushnachandra Panigrahy·Debasisha Mishra
View original source ↗Read source document ↗Export metadata ↓

Abstract

The equality $(\mc{A}\n\mc{B})^\dagger = \mc{B}^\dagger \n \mc{A}^\dagger$ for any two complex tensors $\mc{A}$ and $\mc{B}$ of arbitrary order, is called as the {\it reverse-order law} for the Moore-Penrose inverse of arbitrary order tensors via the Einstein product. Panigrahy {\it et al.} [Linear Multilinear Algebra; 68 (2020), 246-264.] obtained several necessary and sufficient conditions to hold the reverse-order law for the Moore-Penrose inverse of even-order tensors via the Einstein product, very recently. This notion is revisited here among other results. In this context, we present several new characterizations of the reverse-order law of arbitrary order tensors via the same product. More importantly, we illustrate a result on the Moore-Penrose inverse of a sum of two tensors as an application of the reverse-order law which leaves an open problem. We recall the definition of the Frobenius norm and the spectral norm to illustrate a result for finding the additive perturbation bounds of the Moore-Penrose inverse under the Frobenius norm. We conclude our paper with the introduction of the notion of sub-proper splitting for tensors which may help to find an iterative solution of a tensor multilinear system.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

Krushnachandra Panigrahy, Debasisha Mishra. 2018-09-19. On reverse-order law of tensors and its application to additive results on Moore-Penrose inverse. https://doi.org/10.1007/s13398-020-00916-1

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗