Gradient-based iterative algorithms for the tensor nearness problems associated with Sylvester tensor equations

DOI10.4310/CMS.2021.V19.N8.A9MaRDI QIDQ2057068zbMATH OpenOpenAlexFDO

Authors Maolin Liang, Bing Zheng

Publication date 8 December 2021

Published in Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/cms.2021.v19.n8.a9

zbMATH Keywords

least F-norm solutionSylvester tensor equationtensor nearness problem

Mathematics Subject Classification ID

Numerical methods for matrix equations (65F45)

Cited in

(5)

• Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES
• Gradient based iterative methods for solving symmetric tensor equations
• scientific article; zbMATH DE number 6432433 (Why is no real title available?)
• scientific article; zbMATH DE number 6262900 (Why is no real title available?)
• Multilinear hyperquiver representations

This page was built for publication: Gradient-based iterative algorithms for the tensor nearness problems associated with Sylvester tensor equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2057068)