{"title":"求解张量方程的草图-投影法","authors":"Ling Tang , Yanjun Zhang , Hanyu Li","doi":"10.1016/j.amc.2025.129735","DOIUrl":null,"url":null,"abstract":"<div><div>We propose a regular sketch-and-project method for solving linear tensor equations based on the t-product and present its equivalent Fourier domain version, along with several special cases corresponding to existing classical matrix equation methods. Furthermore, we extend this framework via a hierarchical approach to solve generalized Sylvester tensor equations. All the methods are proved to converge linearly in expectation. Finally, numerical experiments demonstrate the efficiency and effectiveness of the proposed approach.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"511 ","pages":"Article 129735"},"PeriodicalIF":3.4000,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On sketch-and-project methods for solving tensor equations\",\"authors\":\"Ling Tang , Yanjun Zhang , Hanyu Li\",\"doi\":\"10.1016/j.amc.2025.129735\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We propose a regular sketch-and-project method for solving linear tensor equations based on the t-product and present its equivalent Fourier domain version, along with several special cases corresponding to existing classical matrix equation methods. Furthermore, we extend this framework via a hierarchical approach to solve generalized Sylvester tensor equations. All the methods are proved to converge linearly in expectation. Finally, numerical experiments demonstrate the efficiency and effectiveness of the proposed approach.</div></div>\",\"PeriodicalId\":55496,\"journal\":{\"name\":\"Applied Mathematics and Computation\",\"volume\":\"511 \",\"pages\":\"Article 129735\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2025-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Mathematics and Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0096300325004606\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300325004606","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
On sketch-and-project methods for solving tensor equations
We propose a regular sketch-and-project method for solving linear tensor equations based on the t-product and present its equivalent Fourier domain version, along with several special cases corresponding to existing classical matrix equation methods. Furthermore, we extend this framework via a hierarchical approach to solve generalized Sylvester tensor equations. All the methods are proved to converge linearly in expectation. Finally, numerical experiments demonstrate the efficiency and effectiveness of the proposed approach.
期刊介绍:
Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results.
In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.