On the iterative criterion for strong \(\mathcal{H}\)-tensors (Q1699368): Difference between revisions
From MaRDI portal
Latest revision as of 05:55, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the iterative criterion for strong \(\mathcal{H}\)-tensors |
scientific article |
Statements
On the iterative criterion for strong \(\mathcal{H}\)-tensors (English)
0 references
23 February 2018
0 references
Consider an \(m\)th-order \(n\)-dimensional real symmetric tensor. Verifying that it is positive definite is an NP hard problem in general. In [\textit{C. Li} et al., J. Comput. Appl. Math. 255, 1--14 (2014; Zbl 1291.15065)] it is proved that if the tensor is even order with positive diagonal elements and if it is a strong \(\mathcal{H}\)-tensor (SHT), then it is positive definite. They also give an algorithm to verify the SHT property. However, their algorithm does not stop after a finite number of steps when the tensor is not a SHT. In this paper a threshold \(\epsilon>0\) is introduced in a new improved algorithm to verify the SHT property. It is proved that the algorithm stops after a finite number of steps and that it gives the correct answer.
0 references
strong \(\mathcal{H}\)-tensor
0 references
iteration
0 references
positive definiteness
0 references
symmetric tensor
0 references
algorithm
0 references
0 references
0 references
0 references
0 references