676 search results - page 1 / 136 » Sub-stochastic matrix analysis for bounds computation - Theo... |
SIAMSC
2010
13 years 3 months ago
2010
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
TSP
2010
12 years 11 months ago
2010
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
WCNC
2008
IEEE
13 years 11 months ago
2008
IEEE
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
MP
2006
13 years 4 months ago
2006
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...