It is proved that generalized polynomials with rational exponents over a commutative field form an elementary divisor ring; an algorithm for computing the Smith normal form is derived and implemented.
We propose an efficient method for finding a Chebyshev-best soluble approximation to an insoluble system of linear equations over max-plus algebra.
In this paper, we mainly derive the general solutions of two systems of minus partial ordering equations over von Neumann regular rings. Meanwhile, some special cases are correspondingly presented. As applications, we give some necessary and sufficient conditions for the existence of solutions. It can be seen that some known results can be regarded as the special cases of this paper.
Linear matrix approximation problems are often solved by the total least squares minimization (TLS). Unfortunately, the TLS solution may not exist in general. The so-called core problem theory brought an insight into this effect. Moreover, it simplified the solvability analysis if is of column rank one by extracting a core problem having always a unique TLS solution. However, if the rank of is larger, the core problem may stay unsolvable in the TLS sense, as shown for the first time by Hnětynková,...
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.
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...