Results 291 to 300 of about 2,606,652 (334)

INVERTIBLE COMMUTATORS IN MATRIX RINGS

Journal of Algebra and Its Applications, 2011
In a matrix ring R = 𝕄2(S) where S is a commutative ring, we study equations of the form XY - YX = U ∈ GL 2(S), focusing on matrices in R that can appear as X or as XY in such equations. These are the completable and the reflectable matrices in R.
Dinesh Khurana, Tsit Yuen Lam
openaire   +2 more sources

SDIM: A Subtly Designed Invertible Matrix for Enhanced Privacy-Preserving Outsourcing Matrix Multiplication and Related Tasks

IEEE Transactions on Dependable and Secure Computing
Matrix multiplication computation (MMC) is a fundamental operation with various applications, including linear regression, k-nearest neighbor classification and biometric identification. However, performing these tasks with large-scale datasets surpasses
Chun Liu, Xuexian Hu, Xiaofeng Chen, Jianghong Wei, Wenfen Liu   +4 more
semanticscholar   +1 more source

Low-Rank Tensor Completion With a New Tensor Nuclear Norm Induced by Invertible Linear Transforms

Computer Vision and Pattern Recognition, 2019
This work studies the low-rank tensor completion problem, which aims to exactly recover a low-rank tensor from partially observed entries. Our model is inspired by the recently proposed tensor-tensor product (t-product) based on any invertible linear ...
Canyi Lu, Xi Peng, Yunchao Wei
semanticscholar   +1 more source

Study of Inverter System in MATRIX motor

2020 IEEE 9th International Power Electronics and Motion Control Conference (IPEMC2020-ECCE Asia), 2020
Recently, PMSM (Permanent Magnet Synchronous Motor) is widely used in terms of high efficiency and high torque density. In order to increase the penetration of PMSM, it is necessary to add further value like increasing torque, low noise and low vibration. In the previous research, A MATRIX motor has been proposed.
Kan Akatsu, Rei Kasahara
openaire   +2 more sources

A recursive method to invert the LTSN matrix

Progress in Nuclear Energy, 1998
In this work it is presented a recursive method to invert the LTSN matrix. Numerical simulations are presented.
A.V. Cardona, Jacques Duílio Brancher, Marco Tullio de Vilhena   +2 more
openaire   +2 more sources

Groups of invertible elements of matrix rings

Siberian Mathematical Journal, 1999
Let \({\mathcal O}\subseteq\mathbb{Q}_n\) be an arbitrary finitely generated matrix ring over the rationals. The author presents an algorithmic description of the group of units \(U({\mathcal O})\) of this ring. If \(\mathcal O\) is a matrix ring irreducible over the rationals then the ring is a ring with almost solvable endomorphism group whenever the
openaire   +3 more sources

Moore–Penrose inverse of an invertible infinite matrix

, 2006
In this article we show that, contrary to finite matrices (with real or complex entries) an invertible infinite matrix V could have a Moore–Penrose inverse that is not a classical inverse of V. This also answers a recent open problem on infinite matrices.
K. Sivakumar
semanticscholar   +1 more source

On Inverted Matrix Variate Gamma Distribution

Communications in Statistics - Theory and Methods, 2013
In this article, we study several properties of the inverted matrix variate gamma distribution. Further, Bayes estimators using conjugate prior knowledge under square error loss function are also derived.
Anis Iranmanesh, Mohammad Arashi, S. M. M. Tabatabaey, Daya K. Nagar   +3 more
openaire   +2 more sources

Concise row-pruning algorithm to invert a matrix

Applied Mathematics and Computation, 1994
The authors present in a vector formulation an \(O(mn^ 2)\) direct concise algorithm that prunes resp. identifies the linearly dependent (ld) rows of an arbitrary \(m \times n\) matrix. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for the equations is readily ...
Lakshmikantham, V, Sen, SK, Sivasundaram, S   +2 more
openaire   +3 more sources

Inverting the Pascal Matrix Plus One

The American Mathematical Monthly, 2002
Immediately we notice this is basically the same matrix, except with every other subdiagonal multiplied by a factor of negative one. Obviously this result generalizes to any size Pascal matrix, and there is something so beautiful and natural about this result that it hardly needs a proof (see Call and Velleman [2] for a particularly elegant ...
Rita Aggarwala, Michael P. Lamoureux
openaire   +2 more sources