14,084 research outputs found

    Low rank matrix recovery from rank one measurements

    Full text link
    We study the recovery of Hermitian low rank matrices XCn×nX \in \mathbb{C}^{n \times n} from undersampled measurements via nuclear norm minimization. We consider the particular scenario where the measurements are Frobenius inner products with random rank-one matrices of the form ajaja_j a_j^* for some measurement vectors a1,...,ama_1,...,a_m, i.e., the measurements are given by yj=tr(Xajaj)y_j = \mathrm{tr}(X a_j a_j^*). The case where the matrix X=xxX=x x^* to be recovered is of rank one reduces to the problem of phaseless estimation (from measurements, yj=x,aj2y_j = |\langle x,a_j\rangle|^2 via the PhaseLift approach, which has been introduced recently. We derive bounds for the number mm of measurements that guarantee successful uniform recovery of Hermitian rank rr matrices, either for the vectors aja_j, j=1,...,mj=1,...,m, being chosen independently at random according to a standard Gaussian distribution, or aja_j being sampled independently from an (approximate) complex projective tt-design with t=4t=4. In the Gaussian case, we require mCrnm \geq C r n measurements, while in the case of 44-designs we need mCrnlog(n)m \geq Cr n \log(n). Our results are uniform in the sense that one random choice of the measurement vectors aja_j guarantees recovery of all rank rr-matrices simultaneously with high probability. Moreover, we prove robustness of recovery under perturbation of the measurements by noise. The result for approximate 44-designs generalizes and improves a recent bound on phase retrieval due to Gross, Kueng and Krahmer. In addition, it has applications in quantum state tomography. Our proofs employ the so-called bowling scheme which is based on recent ideas by Mendelson and Koltchinskii.Comment: 24 page

    Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays

    Full text link
    The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree. The result is obtained in three steps: first, by computing an independent set of generators for the d-space partition induced by the input; then, by reducing the solid expression to an equivalent logical formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. This method is implemented in Julia using sparse arrays. The computational evaluation of every possible solid expression, usually denoted as CSG (Constructive Solid Geometry), is reduced to an equivalent logical expression of a finite set algebra over the cells of a space partition, and solved by native bitwise operators.Comment: revised version submitted to Computer-Aided Geometric Desig
    corecore