An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor
From MaRDI portal
Publication:2020532
DOI10.1016/j.cam.2021.113498zbMath1464.15037OpenAlexW3132352384MaRDI QIDQ2020532
Publication date: 23 April 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113498
Positive matrices and their generalizations; cones of matrices (15B48) Multilinear algebra, tensor calculus (15A69)
Cites Work
- Tensor Decompositions and Applications
- An \(H\)-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms
- Programmable criteria for strong \(\mathcal {H}\)-tensors
- \(Z\)-eigenvalue inclusion theorems for tensors
- \(\mathcal H\)-tensors and nonsingular \(\mathcal H\)-tensors
- Criteria for strong \(H\)-tensors
- Discriminants and nonnegative polynomials
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
- Column sufficient tensors and tensor complementarity problems
- Eigenvalues and invariants of tensors
- Iterative criteria for identifying strong \(\mathcal{H}\)-tensors
- Solution structures of tensor complementarity problem
- The tensor splitting methods for solving tensor absolute value equation
- Criterions for the positive definiteness of real supersymmetric tensors
- A modified CG algorithm for solving generalized coupled Sylvester tensor equations
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Some properties of strong \(\mathcal{H}\)-tensors and general \(\mathcal{H}\)-tensors
- \(M\)-tensors and nonsingular \(M\)-tensors
- Eigenvalues of a real supersymmetric tensor
- Nonnegative polynomials and sums of squares
- $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
- Some criteria for identifying strong -tensors and its applications
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- A fast algorithm for the spectral radii of weakly reducible nonnegative tensors
- An iterative algorithm to solve the generalized Sylvester tensor equations
- Krylov subspace methods to solve a class of tensor equations via the Einstein product
- Higher Order Positive Semidefinite Diffusion Tensor Imaging
This page was built for publication: An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor