On some properties of the symplectic and Hamiltonian matrices.
When a system of one-sided max-plus linear equations is inconsistent, the approximate solutions within an admissible error bound may be desired instead, particularly with some sparsity property. It is demonstrated in this paper that obtaining the sparsest approximate solution within a given error bound may be transformed in polynomial time into the set covering problem, which is known to be NP-hard. Besides, the problem of obtaining the sparsest approximate solution within a given error bound...
Let P,Q be two linear idempotents on a Banach space. We show that the closedness of the range and complementarity of the kernel (range) of linear combinations of P and Q are independent of the choice of coefficients. This generalizes known results and shows that many spectral properties of linear combinations do not depend on their coefficients.
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.
If and are two families of unitary bases for , and is a fixed number, let and be subspaces of spanned by vectors in and respectively. We study the angle between and as goes to infinity. We show that when and arise in certain arithmetically defined families, the angles between and may either tend to or be bounded away from zero, depending on the behavior of an associated eigenvalue problem.