On the semi-scalar equivalence of polynomial matrices over a field

Polynomial matrices and of size over a field are semi-scalar equivalent if there exist a nonsingular matrix over and an invertible matrix over such that . The aim of the present report is to present a triangular form of some nonsingular polynomial matrices with respect to semi-scalar equivalence.

Pembentukan Grup Matriks Singular 2×2

The study aims to determine the set of the singular matrix 2×2 that forms the group and describes its properties. The type of research was used exploratory research. Using diagonalization of the singular matrix S, whereas a generator matrix, pseudo-identity, and pseudo-inverse methods, we obtained a group singular matrix 2×2 with standard multiplication operations on the matrix, with conditions namely: (1) closed, (2) associative, (3) there was an element of identity, (4) inverse, there was (A)-1 so A x (A)-1 = (A)-1 x A = Is. The group was the abelian group (commutative group). In addition, in the group, Gs satisfied that if Ɐ A, X, Y element Gs was such that A x X = A x Y then X = Y and X x A = Y x A then X = Y. This show that the group can be applied the cancellation properties like the case in nonsingular matrix group. This research provides further research opportunities on the formation of singular matrix groups 3×3 or higher order.

Diagonal entries of the combined matrix of sign regular matrices of order three

The study of the diagonal entries of the combined matrix of a nonsingular matrix A has been considered by different authors for the classes of M—matrices, positive definite matrices and totally positive (negative) matrices. This problem appears to be difficult as the results have been done only for matrices of order three. In this work, we continue to give the characterization of the diagonal entries of the combined matrix of the remainder sign regular matrices. Thus, the problem is closed for all possible sign regular matrices of order three.

Link Loss Inference Algorithm with Network Topology Aware in Communication Networks

When there are many suspected loss links, the links in the path with a higher pass rate are assumed to be nondrop packet links or assuming that the link with the largest number of shares is a loss link, but this assumption lacks valid proof. In order to overcome these shortcomings, this paper proposes a link loss inference algorithm with network topology aware. The network model is established based on the historical data of the network operation and network topology characteristics. A weighted relative entropy ranking method is proposed to quantify the suspected packet loss links in each independent subset. The packet loss rate of the packet loss link is obtained by solving the unique solution of the simplified nonsingular matrix. Through simulation experiments, it is verified that the proposed algorithm has achieved better results in terms of congestion link determination and link loss rate estimation accuracy.

Two 2-D DOA Estimation Methods with Full and Partial Generalized Virtual Aperture Extension Technology

We address the two-dimensional direction-of-arrival (2-D DOA) estimation problem for L-shaped uniform linear array (ULA) using two kinds of approaches represented by the subspace-like method and the sparse reconstruction method. Particular interest emphasizes on exploiting the generalized conjugate symmetry property of L-shaped ULA to maximize the virtual array aperture for two kinds of approaches. The subspace-like method develops the rotational invariance property of the full virtual received data model by introducing two azimuths and two elevation selection matrices. As a consequence, the problem to estimate azimuths represented by an eigenvalue matrix can be first solved by applying the eigenvalue decomposition (EVD) to a known nonsingular matrix, and the angles pairing is automatically implemented via the associate eigenvector. For the sparse reconstruction method, first, we give a lemma to verify that the received data model is equivalent to its dictionary-based sparse representation under certain mild conditions, and the uniqueness of solutions is guaranteed by assuming azimuth and elevation indices to lie on different rows and columns of sparse signal cross-correlation matrix; we then derive two kinds of data models to reconstruct sparse 2-D DOA via M-FOCUSS with and without compressive sensing (CS) involvements; finally, the numerical simulations validate the proposed approaches outperform the existing methods at a low or moderate complexity cost.

Generalized Inverses Estimations by Means of Iterative Methods with Memory

A secant-type method is designed for approximating the inverse and some generalized inverses of a complex matrix A. For a nonsingular matrix, the proposed method gives us an approximation of the inverse and, when the matrix is singular, an approximation of the Moore–Penrose inverse and Drazin inverse are obtained. The convergence and the order of convergence is presented in each case. Some numerical tests allowed us to confirm the theoretical results and to compare the performance of our method with other known ones. With these results, the iterative methods with memory appear for the first time for estimating the solution of a nonlinear matrix equations.

Various Shadowing in Linear Dynamical Systems

This paper proves that the linear transformation [Formula: see text] on [Formula: see text] has the (asymptotic) average shadowing property if and only if [Formula: see text] is hyperbolic, where [Formula: see text] is a nonsingular matrix, giving a positive answer to a question in [Lee, 2012a]. Besides, it is proved that [Formula: see text] does not have the [Formula: see text]-shadowing property, thus does not have the ergodic shadowing property for every nonsingular matrix [Formula: see text].

Static Analysis of the Free-Free Trusses by Using a Self-Regularization Approach

Following the success of static analysis of free-free 2-D plane trusses by using a self-regularization approach uniquely, we further extend the technique to deal with 3-D problems of space trusses. The inherent singular stiffness of a free-free structure is expanded to a bordered matrix by adding r singular vectors corresponding to zero singular values, where r is the nullity of the singular stiffness matrix. Besides, r constraints are accompanied to result in a nonsingular matrix. Only the pure particular solution with nontrivial strain is then obtained but without the homogeneous solution of no deformation. To link with the Fredholm alternative theorem, the slack variables with zero values indicate the infinite solutions while those with nonzero values imply the case of no solutions. A simple space truss is used to demonstrate the validity of the proposed model. An alternative way of reasonable support system to result in a nonsingular stiffness matrix is also addressed. In addition, the finite-element commercial code ABAQUS is also implemented to check the results.

The triviality condition for kernels of quadratic mappings and its application in optimization methods

The existence of a nonsingular matrix is proved for any space of square symmetric matrices with a trivial quadratic kernel. Some corollaries from this result are obtained for construction of solvers of nonlinear equations and problems of conditional optimization with a Jacobi matrix of incomplete rank based on the theory of