Iterative algorithm with linear convergence rate for determining strong H-tensors
From MaRDI portal
Publication:3306596
DOI10.13413/J.CNKI.JDXBLXB.2018409zbMATH Open1449.65061MaRDI QIDQ3306596FDOQ3306596
Authors: Rui Liu, Qilong Liu, Zhen Chen
Publication date: 12 August 2020
Recommendations
- A new programmable iterative algorithm for identifying strong H-tensors
- On the iterative criterion for strong \(\mathcal{H}\)-tensors
- Two non-parameter iterative algorithms for identifying strong \(\mathcal {H}\)-tensors
- New iterative criteria for strong \(\mathcal{H}\)-tensors and an application
- Iterative criteria for identifying strong \(\mathcal{H}\)-tensors
Cited In (6)
- A new programmable iterative algorithm for identifying strong H-tensors
- Two non-parameter iterative algorithms for identifying strong \(\mathcal {H}\)-tensors
- On HSS-Based Iteration Methods for Two Classes of Tensor Equations
- On an algorithm converging to hyperstochastic tensors
- An iterative algorithm based on strong \(\mathcal{H} \)-tensors for identifying positive definiteness of irreducible homogeneous polynomial forms
- Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor
This page was built for publication: Iterative algorithm with linear convergence rate for determining strong \(\boldsymbol{H}\)-tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3306596)