One way to study an hypergraph is attach it a tensor. Tensors are generalization of matrices, and they efficient encode information in compact form. In this paper we how properties weighted hypergraphs reflected on eigenvalues eigenvectors their associated tensors. We also show efficiently compute eingenvalues with some techniques from numerical algebraic geometry.