Norm of sum of shifted outer products

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite












Consider two vectors $u, v in mathbbR^m$ satisfying $| u |_2 = | v |_2 = 1$ and $#mathrmsupp(v) leq n < m$, where $mathrmsupp$ denotes the support of the vector (i.e. locations of nonzero coordinates). Additionally, assume that $mathrmsupp(u) = mathrmsupp(v)$. Assume that $u^i$ denotes the left-circular shift of $u$ by $i$ locations, i.e.



$$
u = (u_1, dots, u_n, 0, dots, 0) Rightarrow u^1 =
(0, u_2, dots, u_n, 0 dots, u_1)
$$



Form the following matrix:



$$
X = u v^top + u^1 v^1^top + dots + u^m-1 v^m-1^top
$$




Question:
I want to obtain a nontrivial bound on the operator and Frobenius norms of this matrix. The only bound that I was able to obtain so far is using the subadditivity of the Frobenius norm and the fact that $| u_i v_i^top |_F = 1, ; forall i.$
$$
| X |_mathrmop leq | X |_F leq m | u_i v_i^top | = m
$$




Any ideas or pointers to references are more than welcome.







share|cite|improve this question















  • 1




    I'd expect the worst case to be constant $u$ and $v$ on a contiguous support. That would yield a bound of roughly $sqrtnm$ for the Frobenius norm.
    – joriki
    Jul 24 at 4:08














up vote
2
down vote

favorite












Consider two vectors $u, v in mathbbR^m$ satisfying $| u |_2 = | v |_2 = 1$ and $#mathrmsupp(v) leq n < m$, where $mathrmsupp$ denotes the support of the vector (i.e. locations of nonzero coordinates). Additionally, assume that $mathrmsupp(u) = mathrmsupp(v)$. Assume that $u^i$ denotes the left-circular shift of $u$ by $i$ locations, i.e.



$$
u = (u_1, dots, u_n, 0, dots, 0) Rightarrow u^1 =
(0, u_2, dots, u_n, 0 dots, u_1)
$$



Form the following matrix:



$$
X = u v^top + u^1 v^1^top + dots + u^m-1 v^m-1^top
$$




Question:
I want to obtain a nontrivial bound on the operator and Frobenius norms of this matrix. The only bound that I was able to obtain so far is using the subadditivity of the Frobenius norm and the fact that $| u_i v_i^top |_F = 1, ; forall i.$
$$
| X |_mathrmop leq | X |_F leq m | u_i v_i^top | = m
$$




Any ideas or pointers to references are more than welcome.







share|cite|improve this question















  • 1




    I'd expect the worst case to be constant $u$ and $v$ on a contiguous support. That would yield a bound of roughly $sqrtnm$ for the Frobenius norm.
    – joriki
    Jul 24 at 4:08












up vote
2
down vote

favorite









up vote
2
down vote

favorite











Consider two vectors $u, v in mathbbR^m$ satisfying $| u |_2 = | v |_2 = 1$ and $#mathrmsupp(v) leq n < m$, where $mathrmsupp$ denotes the support of the vector (i.e. locations of nonzero coordinates). Additionally, assume that $mathrmsupp(u) = mathrmsupp(v)$. Assume that $u^i$ denotes the left-circular shift of $u$ by $i$ locations, i.e.



$$
u = (u_1, dots, u_n, 0, dots, 0) Rightarrow u^1 =
(0, u_2, dots, u_n, 0 dots, u_1)
$$



Form the following matrix:



$$
X = u v^top + u^1 v^1^top + dots + u^m-1 v^m-1^top
$$




Question:
I want to obtain a nontrivial bound on the operator and Frobenius norms of this matrix. The only bound that I was able to obtain so far is using the subadditivity of the Frobenius norm and the fact that $| u_i v_i^top |_F = 1, ; forall i.$
$$
| X |_mathrmop leq | X |_F leq m | u_i v_i^top | = m
$$




Any ideas or pointers to references are more than welcome.







share|cite|improve this question











Consider two vectors $u, v in mathbbR^m$ satisfying $| u |_2 = | v |_2 = 1$ and $#mathrmsupp(v) leq n < m$, where $mathrmsupp$ denotes the support of the vector (i.e. locations of nonzero coordinates). Additionally, assume that $mathrmsupp(u) = mathrmsupp(v)$. Assume that $u^i$ denotes the left-circular shift of $u$ by $i$ locations, i.e.



$$
u = (u_1, dots, u_n, 0, dots, 0) Rightarrow u^1 =
(0, u_2, dots, u_n, 0 dots, u_1)
$$



Form the following matrix:



$$
X = u v^top + u^1 v^1^top + dots + u^m-1 v^m-1^top
$$




Question:
I want to obtain a nontrivial bound on the operator and Frobenius norms of this matrix. The only bound that I was able to obtain so far is using the subadditivity of the Frobenius norm and the fact that $| u_i v_i^top |_F = 1, ; forall i.$
$$
| X |_mathrmop leq | X |_F leq m | u_i v_i^top | = m
$$




Any ideas or pointers to references are more than welcome.









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Jul 23 at 23:22









VHarisop

804421




804421







  • 1




    I'd expect the worst case to be constant $u$ and $v$ on a contiguous support. That would yield a bound of roughly $sqrtnm$ for the Frobenius norm.
    – joriki
    Jul 24 at 4:08












  • 1




    I'd expect the worst case to be constant $u$ and $v$ on a contiguous support. That would yield a bound of roughly $sqrtnm$ for the Frobenius norm.
    – joriki
    Jul 24 at 4:08







1




1




I'd expect the worst case to be constant $u$ and $v$ on a contiguous support. That would yield a bound of roughly $sqrtnm$ for the Frobenius norm.
– joriki
Jul 24 at 4:08




I'd expect the worst case to be constant $u$ and $v$ on a contiguous support. That would yield a bound of roughly $sqrtnm$ for the Frobenius norm.
– joriki
Jul 24 at 4:08















active

oldest

votes











Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);








 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2860859%2fnorm-of-sum-of-shifted-outer-products%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2860859%2fnorm-of-sum-of-shifted-outer-products%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Color the edges and diagonals of a regular polygon

Relationship between determinant of matrix and determinant of adjoint?