Explore the vast range of titles available.

In matrix-valued datasets the sampled matrices often exhibit correlations among both their rows and their columns. A useful and parsimonious model of such dependence is the matrix normal model, in which the covariances among the elements of a random matrix are parameterized in terms of the Kronecker product of two covariance matrices, one representing row covariances and one representing column covariance. An appealing feature of such a matrix normal model is that the Kronecker covariance structure allows for standard likelihood inference even when only a very small number of data matrices is available. For instance, in some cases a likelihood ratio test of dependence may be performed with a sample size of one. However, more generally the sample size required to ensure boundedness of the matrix normal likelihood or the existence of a unique maximizer depends in a complicated way on the matrix dimensions. This motivates the study of how large a sample size is needed to ensure that maximum likelihood estimators exist, and exist uniquely with probability one. Our main result gives precise sample size thresholds in the paradigm where the number of rows and the number of columns of the data matrices differ by at most a factor of two. Our proof uses invariance properties that allow us to consider data matrices in canonical form, as obtained from the Kronecker canonical form for matrix pencils.

All possible nonlocal versions of the derivative nonlinear Schrödinger equations are derived by the nonlocal reduction from the Chen–Lee–Liu equation, the Kaup–Newell equation and the Gerdjikov–Ivanov equation which are gauge equivalent to each other. Their solutions are obtained by composing constraint conditions on the double Wronskian solution of the Chen–Lee–Liu equation and the nonlocal analogues of the gauge transformations among them. Through the Jordan decomposition theorem, those solutions of the reduced equations from the Chen–Lee–Liu equation can be written as canonical form within real field.

This paper presents a methodology for finding a pseudo-upper or lower triangular state-space realization (SSR) from an incommensurate fractional-order transfer function. This SSR is obtained for a particular case of incommensurate fractional-order systems that can be represented by pseudo-upper or lower triangular multi-order state-space equations, which are derived by drawing the block diagram of the transfer functions. The obtained realization is very similar to the controllability canonical form for ordinary transfer functions. It is demonstrated that the obtained realization is controllable. Thus, the state feedback controllers can be systematically designed for these systems.

This paper utilizes the high-order fully actuated (HOFA) system approach to synthesize a class of nonlinear systems. First, the original nonlinear system can be rewritten in a quasi-linear form, which is more general than other nonlinear systems, such as strict-feedback systems. Based on a rank condition, the quasi-linear system can be transformed into a canonical form. Second, a simple transformation is adopted to convert the above canonical form into the HOFA model. Once an HOFA model is derived, the authors design a controller to make the closed-loop system a constant linear system with the desired eigenstructure. Finally, a numerical example illustrates the fitness and effectiveness of the proposed approach.

Riemman metric tensor (Rmt) plays a significant role in deducing basic formulas and equations arising in differential geometry and (pseudo-) Riemannian manifolds. It is a fundamental and challenging problem to determine the equivalence of indexed differential Rmt polynomials. This paper solves the problem by extending Gröbner basis theory and the previous work on the computational theory for indexed differentials. L -expansion of an indexed differential Rmt polynomial is defined. Then a decomposed form of the Gröbner basis of defining syzygies of the polynomial ring is presented, based on a partition of elementary indexed monomials. Meanwhile, the upper bound of the dummy index numbers of sim-monomials of the elements in each disjoint elementary indexed monomial subset is found. Finally, a DST-fundamental restricted ring is constructed, and the canonical form of a polynomial is confirmed to be the normal form with respect to the Gröbner basis in the DST-fundamental restricted ring.

A global framework for treating nonlinear differential dynamical systems is presented. It rests on the fact that most systems can be transformed into the quasi-polynomial format. Any system in this format belongs to an infinite equivalence class characterized by two canonical forms, the Lotka-Volterra (LV) and the monomial systems. Both forms allow for finding total or partial integrability conditions, invariants and dimension reductions of the original systems. The LV form also provides Lyapunov functions and systematic tools for stability analysis. An abstract Lie algebra is shown to underlie the whole formalism. This abstract algebra can be expressed in several realizations among which are the bosonic creation-destruction operators. One of these representations allows one to obtain the analytic form of the general coefficient of the Taylor series representing the solution of the original system. This generates a new class of special functions that are solutions of these nonlinear dynamical systems. From the monomial canonical form, one can prove an equivalence relationship between urn processes and dynamical systems. This establishes a new link between nonlinear dynamics and stochastic processes. This article is part of the theme issue 'Dissipative structures in matter out of equilibrium: from chemistry, photonics and biology (part 1)'.

Abstract We propose a method for solving diagnosis and estimation problems based on the Jordan canonical form. The problems of constructing diagnostic observers, virtual sensors, and interval and sliding-mode observers are considered. Algorithms for solving these problems are designed for both linear and nonlinear systems in the presence of exogenous disturbances and measurement noise. It is shown that in some cases, the use of the Jordan canonical form reduces the complexity of the observers and sensors and simplifies the procedure for their synthesis compared with the identification canonical form. This is illustrated by a practical example.

In this paper, interval observers are designed for linear dynamic systems described by continuous-time models with exogenous disturbances, measurement noises, and parametric uncertainties. Jordan canonical form-based relations are presented for an interval observer that estimates the set of admissible values of a given linear function of the system state vector. The theoretical results are illustrated by a practical example.

In the era of big data and multimedia communication, securing color images against unauthorized access and attacks is a pressing challenge. While quaternion-based models provide a unified representation for color images, most existing encryption schemes rely on single-image frameworks or lack the mathematical rigor to ensure both security and feasibility. To bridge this gap, this paper introduces a system of generalized Sylvester-type quaternion matrix equations as a novel encryption model. By using the equivalence canonical forms of five matrices arranged in a specific array, we provide necessary and sufficient conditions for the solvability of the generalized Sylvester-type quaternion matrix equation system, depending on the rank of the coefficient matrix. Numerical examples are provided to validate the obtained results. As an example of applications, we develop an encryption scheme for color images based on the proposed quaternion matrix equation system. Experimental results confirm the high feasibility of the proposed scheme. Notably, the proposed model supports dynamic key updates and multi-image secure transmission, making it highly adaptable for real-world applications. By integrating advanced quaternion matrix theory with practical image encryption, this work offers a scalable, secure, and mathematically sound approach to color image protection.

Practical algorithms for computing canonical forms of multi-digraphs do not exist in the literature. This paper proposes two practical approaches for finding canonical forms, from the perspective of nD symbolic computation. Initially, the approaches turn the problem of finding canonical forms of multi-digraphs into computing canonical forms of indexed monomials in computer algebra. Then, the first approach utilizes the double coset representative method in computational group theory for canonicalization of indexed monomials and shows that finding the canonical forms of a class of multi-digraphs in practice has polynomial complexity of approximately O((k+p)2) or O(k2.1) by the computer algebra system (CAS) tool Tensor-canonicalizer. The second approach verifies the equivalence of canonicalization of indexed monomials and finding canonical forms of (simple) colored tripartite graphs. It is found that the proposed algorithm takes approximately O((k+2p)4.803) time for a class of multi-digraphs in practical implementation, combined with one of the best known graph isomorphism tools Traces, where k and p are the vertex number and edge number of a multi-digraph, respectively.