arXiv · 2408.10036
The linear targeting problem
Abstract
For given real or complex $m \times n$ data matrices $X$, $Y$, we investigate when there is a matrix $A$ such that $AX = Y$, and $A$ is invertible, Hermitian, positive (semi)definite, unitary, an orthogonal projection, a reflection, complex symmetric, or normal.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kyle Bierly, Stephan Ramon Garcia, Roger A. Horn. 2024-08-19. The linear targeting problem. https://arxiv.org/abs/2408.10036
Cite the original work for its findings. Save a collection to share your selection of sources.