CORR
2006
Springer
13 years 4 months ago
2006
Springer
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classic...
COMBINATORICS
2006
13 years 4 months ago
2006
For n a positive integer, we show that the number of of 2n-tuples of integers that are the row and column sums of some n
COMBINATORICS
2006
13 years 4 months ago
2006
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
COMBINATORICS
2006
13 years 4 months ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
FOCM
2008
13 years 4 months ago
2008
In this paper, we consider some matrix subgroups of the general linear group and in particular the special linear group that are defined by a quadratic matrix identity. The Lie al...
AUTOMATICA
2006
13 years 4 months ago
2006
Design of iterative learning control (ILC) often requires some prior knowledge about a system's control matrix. In some applications, such as uncalibrated visual servoing, th...
CSDA
2008
13 years 4 months ago
2008
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
DM
2010
13 years 4 months ago
2010
In 1977, Ganter and Teirlinck proved that any 2t
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
How many random entries of an n