Programmable criteria for strong H-tensors
From MaRDI portal
Publication:503364
DOI10.1007/S11075-016-0145-4zbMATH Open1357.65048OpenAlexW2465974764MaRDI QIDQ503364FDOQ503364
Authors: Qilong Liu, Liqun Qi, Yaotang 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
Recommendations
- 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 \(\mathcal H\)-tensors and its application
algorithmnumerical exampleirreducibilitypositive semidefinitenessstrong \(\mathcal {H}\)-tensorsstrong \(\mathcal M\)-tensor
Cites Work
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- The number of eigenvalues of a tensor
- Eigenvalues of a real supersymmetric tensor
- Eigenvalues and invariants of tensors
- Z-eigenvalue methods for a global polynomial optimization problem
- Criterions for the positive definiteness of real supersymmetric tensors
- \(M\)-tensors and nonsingular \(M\)-tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- \(M\)-tensors and some applications
- A practical method for computing the largest \(M\)-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
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Perron-Frobenius theorem for nonnegative tensors
- D-eigenvalues of diffusion kurtosis tensors
- Nonsingular \(H\)-tensor and its criteria
- Rank-one approximation to high order tensors
- Output feedback stabilization and related problems-solution via decision methods
- General procedure for multivariable polynomial positivity test with control applications
- Title not available (Why is that?)
Cited In (24)
- A new programmable iterative algorithm for identifying strong H-tensors
- Some results on Brauer-type and Brualdi-type eigenvalue inclusion sets for tensors
- New iterative criteria for strong \(\mathcal{H}\)-tensors and an application
- Some criteria for identifying strong \(\mathcal{H}\)-tensors
- Iterative criteria for identifying strong \(\mathcal{H}\)-tensors
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- An iterative scheme for testing the positive definiteness of multivariate homogeneous forms
- New methods based on ℋ-tensors for identifying positive definiteness of homogeneous polynomial forms
- New sufficient condition for the positive definiteness of fourth order tensors
- Two non-parameter iterative algorithms for identifying strong \(\mathcal {H}\)-tensors
- An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor
- Some properties of strong \(\mathcal{H}\)-tensors and general \(\mathcal{H}\)-tensors
- Some criteria for identifying \(\mathcal{H}\)-tensors and its applications
- \(SDD_1\) tensors and \(B_1\)-tensors
- Some criteria for \(\mathcal{H}\)-tensors
- New criteria-based \(\mathcal{H}\)-tensors for identifying the positive definiteness of multivariate homogeneous forms
- Refined Geršhgorin disks for tensors and \(G\mathcal{H}\)-tensors
- An iterative algorithm based on strong \(\mathcal{H} \)-tensors for identifying positive definiteness of irreducible homogeneous polynomial forms
- Three dimensional strongly symmetric circulant tensors
- Some criteria for identifying strong -tensors and its applications
- Sufficient conditions for judging quasi-strictly diagonally dominant tensors
- Some new inclusion sets for eigenvalues of tensors with application
- An infinity norm bound for the inverse of strong \(\mathrm{SDD}_1\) matrices with applications
- \textit{QN}-tensor and tensor complementarity problem
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)