Conference paper
Direct binary search (DBS) algorithm with constraints
Kartheek Chandu, Mikel Stanich, et al.
CI-DPHA 2013
We use the left vanishing eigenvector to prove various well-known conditions for determining the nonsingularity of matrices via row sums. This is in contrast to the classical approach of using the right vanishing eigenvector. We show that on occasion this approach results in simpler proofs and generalizations of well-known results. We also present a simple proof of a generalized Gudkov's theorem.
Kartheek Chandu, Mikel Stanich, et al.
CI-DPHA 2013
Arlette Gaillard, Heinz Groeflin, et al.
Theoretical Computer Science
Chai Wah Wu, Gerhard Thompson, et al.
SPIE Optical Engineering + Applications 2004
Chai Wah Wu
NIP 2004