the computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. it is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of new-ton's method, but previous researchers have mentioned that some...

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

In this paper, we propose one low-computation cycle and power-efficient recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architecture adopting a hybrid of input strength reduction, the Chebyshev polynomial, and register-splitting schemes. Comparing with the existing recursive DFT/IDFT architectures, the proposed recursive architecture achieves a reduction in computation-cycle by ha...

The canonical polyadic decomposition (CPD) is a compact which expresses tensor as sum of its rank-1 components. A common step in the computation CPD computing generalized eigenvalue (GEVD) tensor. GEVD provides an algebraic approximation can then be used initialization optimization routines. While noiseless setting exactly recovers CPD, it has recently been shown that pencil-based computations ...