On the Nearest Kronecker Product Problem Under Orthonormal Constraints
Numerical Linear Algebra with Applications · 2025-02 · 32 (1)
DOI: 10.1002/nla.2592 ↗Kurz gefasst
Fachartikel in der Zeitschrift Numerical Linear Algebra with Applications, online erschienen am 10.10.2024. Verfasst von Matthew M. Lin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 16 Literaturangaben. Gefördert von: National Science and Technology Council.
Abstract (Originalsprache)
The Kronecker product enlightens a sophisticated and esthetically pleasing algebraic structure that is a fundamental framework for diverse applications, such as signal processing, image analysis, and quantum computing. This study, proposing an iterative methodology grounded in Wirtinger calculus and polar decomposition, delves into the nearest Kronecker product problem under orthonormal constraints. The iterative approach ensures global convergence toward a local solution from any initial value. Numerical experiments are given to show the efficiency and effectiveness of our approach. Mainly, when the target matrix in the objective function is decomposable, the recovery of the original structure is achievable.
Förderung
- National Science and Technology Council
Zitieren
APA
Lin, M. M., & Lu, B. (2025). On the Nearest Kronecker Product Problem Under Orthonormal Constraints. Numerical Linear Algebra with Applications, 32(1). https://doi.org/10.1002/nla.2592
Vancouver
Lin MM, Lu B. On the Nearest Kronecker Product Problem Under Orthonormal Constraints. Numerical Linear Algebra with Applications. 2025;32(1). doi:10.1002/nla.2592
BibTeX
@article{Lin2025,
author = {Lin, Matthew M. and Lu, Bing‐Ze},
title = {On the Nearest Kronecker Product Problem Under Orthonormal Constraints},
journal = {Numerical Linear Algebra with Applications},
year = {2025},
volume = {32},
number = {1},
doi = {10.1002/nla.2592}
}
EUVIMED