Programmable criteria for strong H-tensors
A real tensor \(\mathcal A\) of order \(m\) and dimension \(n\) is called an \(\mathcal M\)-tensor if there exists a nonnegative tensor \(\mathcal B\) and a positive real number \(\eta \geq \rho({\mathcal B})\) such that \({\mathcal A}=\eta I - {\mathcal B}\). Here \(\rho(.)\) denotes the spectral radius. An \(\mathcal M\)-tensor \(\mathcal A=\eta I - {\mathcal B}\) is called a strong \(\mathcal M\)-tensor if \(\eta > \rho({\mathcal B})\). A tensor \(\mathcal A\) is called a strong \(\mathcal H\)-tensor if its comparison tensor is a strong \(\mathcal M\)-tensor. The definition of a comparison tensor is too complicated to be included here. However, since tensors generalize the notion of matrices, one could imagine a comparison tensor as an extension of a comparison matrix, quite well researched in the literature. The main contribution of the work reported, is in obtaining several sufficient conditions on the entries of a tensor \(\mathcal A\) which guarantee that \(\mathcal A\) is a strong \(\mathcal H\)-tensor. Consequently, an algorithm to identify strong \(\mathcal H\)-tensors is proposed. Numerical examples are used as illustrations.
- Some criteria for identifying strong \( \mathcal{H} \)-tensors and its applications
- New iterative criteria for strong \(\mathcal{H}\)-tensors and an application
- Iterative criteria for identifying strong \(\mathcal{H}\)-tensors
- On the iterative criterion for strong \(\mathcal{H}\)-tensors
- New practical criteria for H-tensors and its application
- \(M\)-tensors and nonsingular \(M\)-tensors
- \(M\)-tensors and some applications
- A Multilinear Singular Value Decomposition
- A practical method for computing the largest M-eigenvalue of a fourth-order partially symmetric tensor
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Criterions for the positive definiteness of real supersymmetric tensors
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Finding the largest eigenvalue of a nonnegative tensor
- Further results for Perron-Frobenius theorem for nonnegative tensors
- General procedure for multivariable polynomial positivity test with control applications
- scientific article; zbMATH DE number 3530031 (Why is no real title available?)
- Nonsingular \(H\)-tensor and its criteria
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Output feedback stabilization and related problems-solution via decision methods
- Perron-Frobenius theorem for nonnegative tensors
- Rank-one approximation to high order tensors
- Shifted power method for computing tensor eigenpairs
- The number of eigenvalues of a tensor
- Z-eigenvalue methods for a global polynomial optimization problem
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- On the iterative criterion for strong \(\mathcal{H}\)-tensors
- Iterative criteria for identifying strong \(\mathcal{H}\)-tensors
- Some criteria for identifying strong \(\mathcal{H}\)-tensors
- An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor
- New criteria-based \(\mathcal{H}\)-tensors for identifying the positive definiteness of multivariate homogeneous forms
- \textit{QN}-tensor and tensor complementarity problem
- An iterative algorithm based on strong \(\mathcal{H} \)-tensors for identifying positive definiteness of irreducible homogeneous polynomial forms
- A new programmable iterative algorithm for identifying strong H-tensors
- Some results on Brauer-type and Brualdi-type eigenvalue inclusion sets for tensors
- New sufficient condition for the positive definiteness of fourth order tensors
- Some properties of strong \(\mathcal{H}\)-tensors and general \(\mathcal{H}\)-tensors
- Two non-parameter iterative algorithms for identifying strong \(\mathcal {H}\)-tensors
- Some criteria for identifying \(\mathcal{H}\)-tensors and its applications
- Some criteria for \(\mathcal{H}\)-tensors
- Sufficient conditions for judging quasi-strictly diagonally dominant tensors
- Some criteria for identifying strong \( \mathcal{H} \)-tensors and its applications
- Three dimensional strongly symmetric circulant tensors
- An iterative scheme for testing the positive definiteness of multivariate homogeneous forms
- Some new inclusion sets for eigenvalues of tensors with application
- New methods based on ℋ-tensors for identifying positive definiteness of homogeneous polynomial forms
- New iterative criteria for strong \(\mathcal{H}\)-tensors and an application
- Criteria for strong H-tensors
- An infinity norm bound for the inverse of strong \(\mathrm{SDD}_1\) matrices with applications
- SDD₁ tensors and B₁-tensors
- Refined Geršhgorin disks for tensors and \(G\mathcal{H}\)-tensors
- Modified Z-eigenvalue inclusion intervals for tensors with applications
- New iterative schemes for identifying strong \(\mathcal{H}\)-tensors and their applications
- An improved iterative algorithm for identifying strong \(\mathcal{H}\)-tensors
- New iterative scheme-based strong \(\mathcal{H}\)-tensors for identifying the positive definiteness of multivariate homogeneous forms
This page was built for publication: Programmable criteria for strong \(\mathcal {H}\)-tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503364)
