For every positive definite quadratic form in variables the reciprocal of the square root of the discriminant is equal to the arithmetic mean of the values assumed by the form on the sphere centered at and with radius raised to the ()-th. power. Various consequences are deduced from this, in particular a simplification of some calculations from which one obtains the possibility of solving linear systems using spherical means rather than determinants.
From the fact that the unique solution of a homogeneous linear algebraic system is the trivial one we can obtain the existence of a solution of the nonhomogeneous system. Coefficients of the systems considered are elements of the Colombeau algebra of generalized real numbers. It is worth mentioning that the algebra is not a field.
Recently, Wang (2017) has introduced the -nonnegative double splitting using the notion of matrices that leave a cone invariant and studied its convergence theory by generalizing the corresponding results for the nonnegative double splitting by Song and Song (2011). However, the convergence theory for -weak regular and -nonnegative double splittings of type II is not yet studied. In this article, we first introduce this class of splittings and then discuss the convergence theory for these sub-classes...
In this paper explicit expressions for solutions of Cauchy problems and two-point boundary value problems concerned with the generalized Riccati matrix differential equation are given. These explicit expressions are computable in terms of the data and solutions of certain algebraic Riccati equations related to the problem. The interplay between the algebraic and the differential problems is used in order to obtain approximate solutions of the differential problem in terms of those of the algebraic...
MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35We introduce sparse linear underdetermined systems with embedded network structure. Their structure is inherited from the non-homogeneous network ow programming problems with nodes of variable intensities. One of the new applications of the researched underdetermined systems is the sensor location problem (SLP) for a multigraph. That is the location of the minimum number of sensors in the nodes of the multigraph, in order to determine the arcs ow...
The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite graph. As consequence, occurance of arithmetic zeros will not terminate perfect Gaussian elimination on sparse matrices having associated a chordal bipartite graph. Next, a property concerning minimal edge separators is presented. Finally, it is shown that,...
Let and for . Max-algebra is an analogue of linear algebra developed on the pair of operations extended to matrices and vectors. The system of equations and inequalities have each been studied in the literature. We consider a problem consisting of these two systems and present necessary and sufficient conditions for its solvability. We also develop a polynomial algorithm for solving max-linear program whose constraints are max-linear equations and inequalities.
We propose an efficient method for finding a Chebyshev-best soluble approximation to an insoluble system of linear equations over max-plus algebra.