Results 91 to 100 of about 1,700,750 (206)
NILPOTENTS ZERO DIVISORS OF A MULTIDIMENSIONAL MATRIX
In this article, the necessary conditions for nilpotency of matrices of three and higher dimensions are studied. In addition, its application to quadratic stochastic operators is presented.
openaire +2 more sources
On n-quasi- [m,C] $[m,C]$-isometric operators
For positive integers m and n, an operator T∈B(H) $T \in B ( H )$ is said to be an n-quasi- [m,C] $[m,C]$-isometric operator if there exists some conjugation C such that T∗n(∑j=0m(−1)j(mj)CTm−jC.Tm−j)Tn=0 . In this paper, some basic structural properties
Junli Shen
doaj +1 more source
Quick design of feasible tensor networks for constrained combinatorial optimization [PDF]
Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent them from handling real-world problems.
Hyakka Nakada +2 more
doaj +1 more source
On Nilpotent Elements and Armendariz Modules
For a left module MR over a non-commutative ring R, the notion for the class of nilpotent elements (nilR(M)) was first introduced and studied by Sevviiri and Groenewald in 2014 (Commun. Algebra, 42, 571–577).
Nazeer Ansari +4 more
doaj +1 more source
Algorithm to compute minimal matrix representation of nilpotent lie algebras
As it is well-known there exist matrix representations of any given finite-dimensional complex Lie algebra. More concretely, such representations can be obtained by means of an isomorphic matrix Lie algebra consisting of upper-triangular square matrices.
Ceballos González, Manuel +2 more
openaire +4 more sources
Index reduction for rectangular descriptor systems via feedbacks
Index plays a fundamental role in the study of descriptor systems. For regular descriptor systems, calculation of the index can be performed by calculating the index of the nilpotent matrix obtained by means of the Weierstrass canonical form ...
Vikas Kumar Mishra +2 more
doaj +1 more source
Computational Study of Fuzzy Neutrosophic Soft Matrices in Python: Consistency and Weak Transitivity [PDF]
In this study, we introduce a novel framework for defining and analyzing two specific types of Fuzzy Neutrosophic Soft Matrices (FNSMs): consistent and weakly transitive.
M Kavitha +3 more
doaj +1 more source
Positive stable linear systems with desired poles and zeros [PDF]
A new method of the decomposition of the fractional descriptor linear continuoustime and discrete-time systems into dynamical and static parts is proposed.
Lukasz Sajewski, Tadeusz Kaczorek
doaj +1 more source
GENERATING POTENTIALLY NILPOTENT FULL SIGN Patterns [PDF]
A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The refined inertia of a matrix pattern is defined and techniques are developed for constructing potentially nilpotent full sign patterns.
Dale D. Olesky +20 more
core +1 more source
On Weak e-Reflexive Rings and Their Nil Extensions
In this work, we establish the relationships between weak e-reversibility and weak e-semicommutativity, introducing weak e-reflexive rings as a natural generalization of reflexive and e-reflexive rings.
Awn Alqahtani +2 more
doaj +1 more source

