The linear targeting problem
Abstract
For given real or complex m × 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.