Solving higher order Fuchs type differential systems avoiding the increase of the problem dimension.
Solving linear systems with a Levinson-like solver.
Solving systems of two–sided (max, min)–linear equations
A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.
Solving the sensor cover energy problem via integer linear programming
This paper demonstrates that the sensor cover energy problem in wireless communication can be transformed into a linear programming problem with max-plus linear inequality constraints. Consequently, by a well-developed preprocessing procedure, it can be further reformulated as a 0-1 integer linear programming problem and hence tackled by the routine techniques developed in linear and integer optimization. The performance of this two-stage solution approach is evaluated on a set of randomly generated...
Some algebraic and statistical properties of WLSEs under a general growth curve model.
Some algebraic theorems on vector-valued forms and their geometric applications
Some aspects of Hankel matrices in coding theory and combinatorics.
Some Basic Properties of Some Special Matrices. Part III
This article describes definitions of subsymmetric matrix, anti-subsymmetric matrix, central symmetric matrix, symmetry circulant matrix and their basic properties.
Some Berezin number inequalities for operator matrices
Some bounds for the spectral radius of the Hadamard product of matrices.
Some characteristic quantities associated with homogeneous -type and -type functions.
Some characterizations of totally nonpositive (totally negative) matrices.
Some conjectures about the Hilbert series of generic ideals in the exterior algebra.
Some considerations of matrix equations using the concept of reproductivity
Some constructions related to Rees matrix rings.
Some Convergent Jacobi-like Procedures for Diagonalising J-Symmetric Matrices.
Some decision problems on integer matrices
Given a finite set of matrices with integer entries, consider the question of determining whether the semigroup they generated 1) is free; 2) contains the identity matrix; 3) contains the null matrix or 4) is a group. Even for matrices of dimension , questions 1) and 3) are undecidable. For dimension , they are still open as far as we know. Here we prove that problems 2) and 4) are decidable by proving more generally that it is recursively decidable whether or not a given non singular matrix belongs...
Some decision problems on integer matrices
Given a finite set of matrices with integer entries, consider the question of determining whether the semigroup they generated 1) is free; 2) contains the identity matrix; 3) contains the null matrix or 4) is a group. Even for matrices of dimension 3, questions 1) and 3) are undecidable. For dimension 2, they are still open as far as we know. Here we prove that problems 2) and 4) are decidable by proving more generally that it is recursively decidable whether or not a given non singular matrix belongs...
Some equalities for generalized inverses of matrix sums and block circulant matrices
Let be complex matrices of the same size. We show in this note that the Moore-Penrose inverse, the Drazin inverse and the weighted Moore-Penrose inverse of the sum can all be determined by the block circulant matrix generated by . In addition, some equalities are also presented for the Moore-Penrose inverse and the Drazin inverse of a quaternionic matrix.
Some estimates in the theory of non-negative matrices