Sciweavers

7 search results - page 1 / 2
» The Complexity of Partition Functions on Hermitian Matrices
Sort
View
MOR
2007
116views more  MOR 2007»
13 years 4 months ago
Complex Matrix Decomposition and Quadratic Programming
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
Yongwei Huang, Shuzhong Zhang
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
13 years 9 days ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
CSDA
2008
115views more  CSDA 2008»
13 years 5 months ago
Complex-valued ICA based on a pair of generalized covariance matrices
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...
Esa Ollila, Hannu Oja, Visa Koivunen
EMMCVPR
2001
Springer
13 years 9 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi