Now showing items 1-1 of 1
Minimum-correction second-moment matching : theory, algorithms and applications
(Massachusetts Institute of Technology, 2020)
We address the problem of finding the closest matrix Ũ a given U under the constraint that a prescribed second-moment matrix P̃ must be matched, i.e.Ũ[T superscript]Ũ . We obtain a closed-form formula for the unique global ...