Matrix Inequalities Research Articles

The Solution of the Hierarchy of Quantum Kinetic Equations for Correlation Matrices with Delta function Potential

The Solution of the Hierarchy of Quantum Kinetic Equations for Correlation Matrices with Delta function Potential

Modeling of fluctuations in dynamical optoelectronic device simulations within a Maxwell-density matrix Langevin approach

We present a full-wave Maxwell-density matrix simulation tool including c-number stochastic noise terms for the modeling of the spatiotemporal dynamics in active photonic devices, such as quantum cascade lasers and quantum dot structures. The coherent light–matter interaction in such devices plays an important role in the generation of frequency combs and other nonlinear and non-classical optical phenomena. Since the emergence of nonlinear and non-classical features is directly linked to the noise properties, detailed simulations of the noise characteristics are required for the development of low-noise quantum optoelectronic sources. Our semiclassical simulation framework is based on the Lindblad equation for the electron dynamics, coupled with Maxwell’s equations for optical propagation in the laser waveguide. Fluctuations arising from the interactions of the optical field and quantum system with their reservoirs are treated within the quantum Langevin theory. Here, the fluctuations are included by adding stochastic c-number terms to the Maxwell-density matrix equations. The implementation in the mbsolve dynamic simulation framework is publicly available.

The R-matrix presentation for the rational form of a quantized enveloping algebra

Let Uq(g) denote the rational form of the quantized enveloping algebra associated to a complex simple Lie algebra g. Let λ be a nonzero dominant integral weight of g, and let V be the corresponding type 1 finite-dimensional irreducible representation of Uq(g). Starting from this data, the R-matrix formalism for quantum groups outputs a Hopf algebra URλ(g) defined in terms of a pair of generating matrices satisfying well-known quadratic matrix relations. In this paper, we prove that this Hopf algebra admits a Chevalley–Serre type presentation which can be recovered from that of Uq(g) by adding a single invertible quantum Cartan element. We simultaneously establish that URλ(g) can be realized as a Hopf subalgebra of the tensor product of the space of Laurent polynomials in a single variable with the quantized enveloping algebra associated to the lattice generated by the weights of V. The proofs of these results are based on a detailed analysis of the homogeneous components of the matrix equations and generating matrices defining URλ(g), with respect to a natural grading by the root lattice of g compatible with the weight space decomposition of End(V).

Dynamic phasor measurement algorithm based on high-precision time synchronization

Ensuring the swift and precise tracking of power system signal parameters, especially the frequency, is imperative for the secure and stable operation of power grids. In instances of faults within the distribution network, abrupt changes in frequency may occur, presenting a challenge for existing algorithms that struggle to effectively track such signal variations. Addressing the need for enhanced performance in the face of frequency mutations, this paper introduces an innovative approach—the Covariance Reconstruction Extended Kalman Filter (CREKF) algorithm. Initially, the dynamic signal model of electric power is meticulously analyzed, establishing a dynamic signal relationship based on high-precision time source sampling tailored to the signal model’s characteristics. Subsequently, the filter gain, covariance matrix, and variance iteration equation are determined based on the signal relationship among three sampling points. In a final step, recognizing the impact of the covariance matrix on algorithmic tracking ability, the paper proposes a covariance matrix reset mechanism utilizing hysteresis induced by output errors. Through extensive verification with simulated signals, the results conclusively demonstrate that the CREKF algorithm exhibits superior measurement accuracy and accelerated tracking speed when confronted with mutating signals.

Research on Robust Adaptive RTK Positioning of Low-Cost Smart Terminals.

The performance of low-cost smart terminals is limited by the performance of their low-cost Global Navigation Satellite System (GNSS) hardware and chips, as well as by the impact of complex urban environments, which affect the positioning accuracy and stability of GNSS services. To this end, this paper proposes a robust adaptive Kalman filter for different environments that can be applied after data preprocessing. Based on the Kalman filter algorithm, a robust estimation approach is introduced into real-time kinematic (RTK) positioning to make judgments on the abnormal observation values of low-cost smart terminals, which amplifies the variance and covariance of the outlier observation equation, and reduces the impact of outliers on positioning performance. The Institute of Geodesy and Geophysics III (IGG III) function is used for regulation purposes, where prior information is modified and refreshed using the equivalent weight matrix and adaptive factors, thus reducing the impact of system model errors on system state estimation results. In addition, a robust factor is defined to adjust positioning deviation weighting between the pre- and post-test robust estimates. The experimental results show that after robust RTK positioning in the static experiments, the overall improvement in positioning accuracies of the Xiaomi 8, Huawei P40, Huawei mate40, and low-cost M8 receiver reached 29.6%, 31.3%, 32.1%, and 30.7%, respectively. Similarly, after applying the proposed robust method in the dynamic experiments, the overall positioning accuracies of the Xiaomi 8, Huawei P40, Huawei mate40, and the low-cost M8 receiver improved by 28.3%, 32.9%, 35.4%, and 26.2%, respectively. The experimental results reveal that an excellent positioning effect of a smartphone is positively correlated with robust RTK positioning performance. However, it is worth noting that when the positioning accuracy reaches a high level, such as the positioning results achieved using low-cost receivers, the robustness performance shows a relatively decreasing trend. This finding suggests that under the condition of high positioning accuracy, the sensitivity of specific positioning equipment to interference sources may increase, resulting in a decline in the effect of robust RTK positioning.

The Anti-symmetric Solution of the Matrix Equation $$AXA^\top =B$$ on a Null Subspace

The Anti-symmetric Solution of the Matrix Equation $$AXA^\top =B$$ on a Null Subspace

Evolution of an interacting fermion–antifermion pair in the near-horizon of the BTZ black hole

In this study, we investigate the evolution of a composite system comprising a fermion–antifermion pair engaged in Cornell-type non-minimal interaction in the near-horizon region of a BTZ black hole. Our exploration involves the derivation of an exact solution for the covariant two-body Dirac equation, derived from quantum electrodynamics through the action principle. To commence our analysis, we formulate the relevant equation, resulting in a 4×4\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$4\ imes 4$$\\end{document} dimensional matrix equation that governs the relative motion of the fermion–antifermion pair. Notably, we demonstrate that this matrix equation results in an exactly solvable wave equation, enabling us to determine the relativistic frequency modes for this spinless static composite system. Our findings unveil a temporal decay in these modes, with the decay time explicitly dependent on both the inter-particle interaction and the spacetime parameters. Our comprehensive examination extends to a detailed analysis of the system’s evolution, shedding light on the influence of inter-particle interaction on the evolution of a fermion–antifermion pair in the near-horizon region of the BTZ black hole.

Comprehensive analysis of bio-inspired laminated composites plates using a quasi-3D theory and higher order FE models

A comprehensive study is carried out by employing various finite element models (FEMs) for the bending, buckling stability and free vibration analyses of bio-inspired helicoidal composite plates with various lamination schemes. A higher order quasi-3D kinematic plate theory is developed to include a shear deformation effect. The variational formulation of the problem is exploited to derive the equations of motion, element stiffness, geometrical stiffness, and mass matrices based on a non-conforming rectangular element. Three different finite elements models are derived based on non-conforming elements with different number of nodes and degree of freedom. The developed finite element model has been validated with those found in the open literature. The effects of boundary condition, lamination scheme, orthotropy ratio and aspect ratio on the mechanical response of the bio-inspired helicoidal composite plates are examined. Notably, for the lamination schemes investigated in this study, no shear locking phenomenon was observed in the analyses conducted using these FEMs. Dimensionless centre deflections, critical buckling loads and fundamental frequencies of bio-inspired helicoidal composite plates vary depending on the type of lamination scheme, boundary condition and aspect ratio. The new orientation schemes can replace the traditional ones to overcome the shear singularity and overcome the delamination defects.

A shift‐splitting Jacobi‐gradient iterative algorithm for solving the matrix equation A𝒱−𝒱‾B=C

AbstractTo improve the convergence of the gradient iterative (GI) algorithm and the Jacobi‐gradient iterative (JGI) algorithm [Bayoumi, Appl Math Inf Sci, 2021], a shift‐splitting Jacobi‐gradient iterative (SSJGI) algorithm for solving the matrix equation is presented in this paper, which is based on the splitting of the coefficient matrices. The proposed algorithm converges to the exact solution for any initial value with some conditions. To demonstrate the effectiveness of the SSJGI algorithm and to compare it to the GI algorithm and the JGI algorithm [Bayoumi, Appl Math Inf Sci, 2021], numerical examples are provided.

Prescribed‐time sensor fault estimation for linear systems with unknown inputs by periodic delayed observers

SummaryThis paper studies the problem of sensor fault estimation for linear systems in the presence of unknown inputs in both input and output channels. Relying on matrix equation theory, the unknown inputs are first removed from the output channel. Second, an augmented descriptor system is constructed by treating both system state and sensor fault as (pseudo)‐state variables. Third, the augmented descriptor system is transformed into a regular one, followed by the elimination of the unknown input from the state equation. Finally, a reduced‐order prescribed‐time sensor fault estimator is obtained by using periodic delayed observers. This matrix equation based approach is then complemented by an alternative one, which relies on successive transformations of state, input and outputs. This approach sheds light on the adopted solvability conditions throughout the paper and on the role of different directions in the output space in handling unknown inputs, sensor faults and the core state estimation problem. Finally, two numerical examples are presented to illustrate the effectiveness of the proposed methodologies.

Distributed maximum correntropy unscented Kalman filter under hybrid attacks in non‐Gaussian environment

AbstractThis paper addresses a distributed nonlinear filtering issue based on maximum correntropy for dealing with randomly occurring hybrid cyber‐attacks in non‐Gaussian environment. The types of cyber‐attacks include denial of service attacks and deception attacks. First, a modified distributed unscented Kalman filter is proposed, using Cauchy kernel‐based maximum correntropy criterion instead of the traditional mean square error criterion, against cyber‐attacks and non‐Gaussian noise. Then based on fixed‐point iterative rules and information fusion strategy, the update equations of state estimates and covariance matrices of the proposed filter are obtained. Furthermore, the sufficient condition guaranteeing its convergence and computational complexity are also given. Finally, an illustrative example is presented to verify the effectiveness of the proposed filter under hybrid cyber‐attacks in non‐Gaussian environment.

Non-magnetic four-port electronic circulators based on 90∘\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$90^\\circ $$\\end{document} non-reciprocal phase-shifters

This paper presents a family of four-port electronic circulators adhering to a new topology symmetry that enables linear, low-loss transistor-based circuit implementations. The underlying principle of operation employs a property of the 90∘\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$90^\\circ $$\\end{document} non-reciprocal phase shifter (NRPS) derived in this article. Under quadrature excitation, the NRPS transfers or reflects exciting signals depending on their respective phase lead. The fundamental topology consists of two back-to-back quadrature hybrid couplers with a 90∘\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$90^\\circ $$\\end{document} NRPS connected in parallel over the line of symmetry, interrupting the circuit’s reciprocity to achieve circular propagation by bypassing or reflecting at the NRPS but not through. We break down the circuit into three fundamental four-port sub-circuits. The transfer function of the cascaded sub-circuits enables an analysis with specific hybrid couplers. It also allows a synthesis of other four-port passive sub-circuits that, with an NRPS, achieve a four-port circulator transfer function by solving a matrix equation. Some of the mathematical solutions have circuit realizations, which are adjusted quadrature hybrid structures that differ from each other by the characteristic impedance of their arms. Two familiar solutions, including the standard quadrature hybrid and a modified design with equal Z0\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$Z_0$$\\end{document}, λ/4\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\lambda /4$$\\end{document} arms, are simulated utilizing lossless lumped element arms and a 4-Path, 65-nm NMOS 90∘\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$90^\\circ $$\\end{document} NRPS. The simulation results verify the theoretical analysis and enable a comparison between the performance of the two circuit solutions around 1 GHz. The four-port circulator with equal arms is implemented on a PCB and measured, yielding better than 1.5 dB insertion loss between the circulator ports, over 17 dB port-to-port reverse isolation, and better than 20 dBr port matching around 1 GHz.

A General Approach to Sylvester-Polynomial-Conjugate Matrix Equations

Sylvester-polynomial-conjugate matrix equations unify many well-known versions and generalizations of the Sylvester matrix equation AX−XB=C which have a wide range of applications. In this paper, we present a general approach to Sylvester-polynomial-conjugate matrix equations via groupoids, vector spaces, and matrices over skew polynomial rings. The obtained results are applied to Sylvester-polynomial-conjugate matrix equations over complex numbers and quaternions. The main role in our approach is played by skew polynomial rings, which are well-known tools in algebra to provide examples of asymmetry between left-sided and right-sided versions of many ring objects.

Transfer of near infrared calibration for gasoline octane number based on screening consistent wavelengths combined with direct standardization algorithm

In order to share multivariate calibration models of gasoline research octane number between different near infrared spectrometers, a novel calibration transfer method, namely combination of screening consistent wavelengths and direct standardization (SWCSS-DS) was proposed. Firstly, screening wavelengths with consistent and stable signals (SWCSS) between instruments was used to select the wavelengths with best stability, and then direct standardization (DS) further corrected the systematic errors that still exist after the SWCSS was implemented. The spectra of 120 standard gasoline samples collected on two near infrared spectrometers of the same type were investigated in detail to verify the validity of the new algorithm. Compared results of other transfer methods such as SWCSS, Slope/Bias (S/B), direct standardisation (DS), and piecewise direct standardization (PDS), the root mean squared error for prediction (RMSEP) of SWCSS-DS algorithm for target samples was decreased from 5.75 to 0.295, and the Akaike information criterion value decreased from 1516 to 640, which were better than those of the SWCSS, S/B, DS and PDS algorithms. Therefore, the joint algorithm of SWCSS-DS has not only improved the universality of the master model, but also reduced the dimension of the spectral matrix and calibration equation, that would provide a more efficient model transfer strategy for the practical applications.

Modified and accelerated relaxed gradient-based iterative algorithms for the complex conjugate and transpose matrix equations

Modified and accelerated relaxed gradient-based iterative algorithms for the complex conjugate and transpose matrix equations

Symplectic solutions of the plane annular sectors in micropolar elasticity

The symplectic approach is utilized to derive the solutions of the plane annular sector in micropolar elasticity. According to the Hellinger-Reissner variational principle, the Hamiltonian canonical equations are obtained for the plane problem in an annular sectorial region. Through the method of separation of variables, we obtain an eigenvalue equation of the Hamiltonian operator matrix which is a system of linear differential equations with variable coefficients. By the method of series solutions, its general solutions can be expressed as the linear combination of Bessel functions and power functions. The corresponding eigensolutions for three types of homogeneous boundary conditions are derived. According to the adjoint symplectic orthogonality of the eigensolutions, the solution of the micropolar plane annular sector is expressed as a series expansion of eigensolutions. Numerical analyses are presented to demonstrate the validity of the proposed method and confirm its ability to accurately capture the size effect.

Singular matrices and pairwise-tangent circles

The idea of using the generalised inverse of a singular matrix A to solve the matrix equation Ax = b has been discussed in the earlier papers [1, 2, 3, 4] in the Gazette. Here we discuss three simple geometric questions which are of interest in their own right, and which illustrate the use of the generalised inverse of a matrix. The three questions are about polygons and circles in the Euclidean plane. We need not assume that a polygon is a simple closed curve, nor that it is convex: indeed, abstractly, a polygon is just a finite sequence (v1, …, vn) of its distinct, consecutive, vertices. It is convenient to let vn + 1 = v1 and (later) Cn + 1 = C1.

On refined rational convex contractions with applications to matrix and implicit functional integral equations

On refined rational convex contractions with applications to matrix and implicit functional integral equations

Publisher's Note

Let A be an n×n real matrix. As shown in the recent paper S.M. Fallat, H.T. Hall, J.C.-H. Lin, and B.L. Shader (2022) [5], if the manifolds MA={G−1AG:G∈GL(n,R)} and Q(sgn(A)) (consisting of all real matrices having the same sign pattern as A), both considered as embedded submanifolds of Rn×n, intersect transversally at A, then every superpattern of sgn(A) also allows a matrix similar to A. Those authors introduced a condition on A (in terms of certain linear matrix equations) equivalent to the above transversality, called the nonsymmetric strong spectral property (nSSP). In this paper, this transversality property of A is characterized using an alternative, more direct and convenient condition, called the similarity-transversality property (STP). Let X=[xij] be a generic matrix of order n whose entries are independent variables. The STP of A is defined as the full row rank property of the Jacobian matrix of the entries of AX−XA at the zero entry positions of A with respect to the nondiagonal entries of X. This new approach makes it possible to take better advantage of the combinatorial structure of the matrix A, and provides theoretical foundation for constructing matrices similar to a given matrix while the entries have certain desired signs. In particular, several important classes of zero-nonzero patterns and sign patterns that require or allow this transversality property are identified. Examples illustrating many possible applications (such as diagonalizability, number of distinct eigenvalues, nilpotence, idempotence, semi-stability, eigenvalues and their algebraic and geometric multiplicities, Jordan canonical form, minimal polynomial, and rank) are provided.

The shifted inner–outer iteration methods for solving Sylvester matrix equations

In this paper, based on the iteration frameworks (Tian et al., 2018, 2020), by introducing a tunable parameter γ to improve their convergence performances, the shifted inner–outer (IO) and multi-step Smith–inner–outer (MSIO) iteration methods are proposed for solving the Sylvester matrix equations. Their convergence properties are analyzed in detail, and the choices of the shifted parameter γ in these algorithms are also investigated. Finally, four numerical examples are implemented to verify the effectiveness of the proposed shifted iteration methods.