Abstract

Kronecker product decomposition is often applied in various fields such as particle physics, signal processing, image processing, semidefinite programming, quantum computing, and matrix time series analysis. In the paper, a new method of Kronecker product decomposition is proposed. Theoretical results ensure that the new method is convergent and stable. The simulation results show that the new method is far faster than the known method. In fact, the new method is very applicable for exact decomposition, fast decomposition, big matrix decomposition, and online decomposition of Kronecker products. At last, the extension direction of the new method is discussed.

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 call

Disclaimer: 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.