Programmable criteria for strong \(\mathcal {H}\)-tensors

DOI10.1007/s11075-016-0145-4zbMath1357.65048OpenAlexW2465974764MaRDI QIDQ503364

Qilong Liu, Liqun Qi, Yao-Tang Li

Publication date: 12 January 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-016-0145-4

zbMATH Keywords

algorithmnumerical exampleirreducibilitypositive semidefinitenessstrong \(\mathcal {H}\)-tensorsstrong \(\mathcal M\)-tensor

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72)

Related Items

An iterative scheme for testing the positive definiteness of multivariate homogeneous forms ⋮ Some new inclusion sets for eigenvalues of tensors with application ⋮ Some criteria for \(\mathcal{H}\)-tensors ⋮ A Levenberg-Marquardt method for solving semi-symmetric tensor equations ⋮ An infinity norm bound for the inverse of strong \(\mathrm{SDD}_1\) matrices with applications ⋮ Two non-parameter iterative algorithms for identifying strong \(\mathcal {H}\)-tensors ⋮ Some criteria for identifying \(\mathcal{H}\)-tensors and its applications ⋮ Sufficient conditions for judging quasi-strictly diagonally dominant tensors ⋮ Some criteria for identifying strong -tensors and its applications ⋮ New methods based on ℋ-tensors for identifying positive definiteness of homogeneous polynomial forms ⋮ Iterative criteria for identifying strong \(\mathcal{H}\)-tensors ⋮ Some criteria for identifying strong \(\mathcal{H}\)-tensors ⋮ New iterative criteria for strong \(\mathcal{H}\)-tensors and an application ⋮ An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor ⋮ An iterative algorithm based on strong \(\mathcal{H} \)-tensors for identifying positive definiteness of irreducible homogeneous polynomial forms ⋮ New criteria-based \(\mathcal{H}\)-tensors for identifying the positive definiteness of multivariate homogeneous forms ⋮ A new programmable iterative algorithm for identifying strong H-tensors ⋮ Some results on Brauer-type and Brualdi-type eigenvalue inclusion sets for tensors ⋮ \textit{QN}-tensor and tensor complementarity problem ⋮ New sufficient condition for the positive definiteness of fourth order tensors

Cites Work

• Unnamed Item
• An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
• Eigenvalues and invariants of tensors
• Perron-Frobenius theorem for nonnegative tensors
• D-eigenvalues of diffusion kurtosis tensors
• Z-eigenvalue methods for a global polynomial optimization problem
• The number of eigenvalues of a tensor
• Criterions for the positive definiteness of real supersymmetric tensors
• Nonsingular \(H\)-tensor and its criteria
• \(M\)-tensors and nonsingular \(M\)-tensors
• Eigenvalues of a real supersymmetric tensor
• Rank-One Approximation to High Order Tensors
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• $M$-Tensors and Some Applications
• A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
• Shifted Power Method for Computing Tensor Eigenpairs
• Finding the Largest Eigenvalue of a Nonnegative Tensor
• Output feedback stabilization and related problems-solution via decision methods
• General procedure for multivariable polynomial positivity test with control applications
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors