Abstract
Strong \(\mathcal {H}\)-tensors play an important role in identifying the positive definiteness of even-order real symmetric tensor. An iterative algorithm for identifying strong \(\mathcal {H}\)-tensors was given in Li et al. (J Comput Appl Math 255:1–14, 2014), where the method does not stop in finite iterative steps when the tensor is not a strong \(\mathcal {H}\)-tensor. In this paper, to overcome this drawback, we present a new algorithm which always terminates after finite iterative steps and needs fewer iterations than the earlier one for a general tensor. Numerical examples are given to show the effectiveness of the proposed method.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
