Generating a rectangular matrix $A_{mxn}$ where $AA^{T}$ is positive semidefinite












0












$begingroup$


Let, $m>n$. I want to generate rectangular matrices $A_{mtext{x}n}$ where $AA^{T}$ is always positive semidefinite (PSD).



When I say 'generate', I mean something like this: Take any lower triangle matrix $L$, the product of $LL^{T}$ will be positive semidefinite. So, no matter how I populate the matrix $L$ I can be sure that $LL^{T}$ is always PSD.



I am looking for something similar in this case.



Thanks in advance.



Here is what I was thinking:



Say, $A$ can be decomposed using SVD such that $A=USigma V^{T}$ where $U$ and $V$ are orthonormal matrices. So, may be we need to generate $U$ and $V$?










share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    This problem is way asier than you think...
    $endgroup$
    – kimchi lover
    Dec 3 '18 at 19:49






  • 2




    $begingroup$
    $AA^T$ is always PSD when $A$ is a real matrix.
    $endgroup$
    – darij grinberg
    Dec 3 '18 at 19:54










  • $begingroup$
    @darijgrinberg I understand that $A^{T}A$ is $ntext{x}n$ square matrix, and will be of min(rank $n$,rank $m$) = $n$, hence PSD. But, I am not sure, how $AA^{T}$ is PSD. Can you please throw some light?
    $endgroup$
    – kasa
    Dec 5 '18 at 19:37


















0












$begingroup$


Let, $m>n$. I want to generate rectangular matrices $A_{mtext{x}n}$ where $AA^{T}$ is always positive semidefinite (PSD).



When I say 'generate', I mean something like this: Take any lower triangle matrix $L$, the product of $LL^{T}$ will be positive semidefinite. So, no matter how I populate the matrix $L$ I can be sure that $LL^{T}$ is always PSD.



I am looking for something similar in this case.



Thanks in advance.



Here is what I was thinking:



Say, $A$ can be decomposed using SVD such that $A=USigma V^{T}$ where $U$ and $V$ are orthonormal matrices. So, may be we need to generate $U$ and $V$?










share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    This problem is way asier than you think...
    $endgroup$
    – kimchi lover
    Dec 3 '18 at 19:49






  • 2




    $begingroup$
    $AA^T$ is always PSD when $A$ is a real matrix.
    $endgroup$
    – darij grinberg
    Dec 3 '18 at 19:54










  • $begingroup$
    @darijgrinberg I understand that $A^{T}A$ is $ntext{x}n$ square matrix, and will be of min(rank $n$,rank $m$) = $n$, hence PSD. But, I am not sure, how $AA^{T}$ is PSD. Can you please throw some light?
    $endgroup$
    – kasa
    Dec 5 '18 at 19:37
















0












0








0





$begingroup$


Let, $m>n$. I want to generate rectangular matrices $A_{mtext{x}n}$ where $AA^{T}$ is always positive semidefinite (PSD).



When I say 'generate', I mean something like this: Take any lower triangle matrix $L$, the product of $LL^{T}$ will be positive semidefinite. So, no matter how I populate the matrix $L$ I can be sure that $LL^{T}$ is always PSD.



I am looking for something similar in this case.



Thanks in advance.



Here is what I was thinking:



Say, $A$ can be decomposed using SVD such that $A=USigma V^{T}$ where $U$ and $V$ are orthonormal matrices. So, may be we need to generate $U$ and $V$?










share|cite|improve this question









$endgroup$




Let, $m>n$. I want to generate rectangular matrices $A_{mtext{x}n}$ where $AA^{T}$ is always positive semidefinite (PSD).



When I say 'generate', I mean something like this: Take any lower triangle matrix $L$, the product of $LL^{T}$ will be positive semidefinite. So, no matter how I populate the matrix $L$ I can be sure that $LL^{T}$ is always PSD.



I am looking for something similar in this case.



Thanks in advance.



Here is what I was thinking:



Say, $A$ can be decomposed using SVD such that $A=USigma V^{T}$ where $U$ and $V$ are orthonormal matrices. So, may be we need to generate $U$ and $V$?







linear-algebra matrices






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 3 '18 at 17:27









kasakasa

328114




328114








  • 2




    $begingroup$
    This problem is way asier than you think...
    $endgroup$
    – kimchi lover
    Dec 3 '18 at 19:49






  • 2




    $begingroup$
    $AA^T$ is always PSD when $A$ is a real matrix.
    $endgroup$
    – darij grinberg
    Dec 3 '18 at 19:54










  • $begingroup$
    @darijgrinberg I understand that $A^{T}A$ is $ntext{x}n$ square matrix, and will be of min(rank $n$,rank $m$) = $n$, hence PSD. But, I am not sure, how $AA^{T}$ is PSD. Can you please throw some light?
    $endgroup$
    – kasa
    Dec 5 '18 at 19:37
















  • 2




    $begingroup$
    This problem is way asier than you think...
    $endgroup$
    – kimchi lover
    Dec 3 '18 at 19:49






  • 2




    $begingroup$
    $AA^T$ is always PSD when $A$ is a real matrix.
    $endgroup$
    – darij grinberg
    Dec 3 '18 at 19:54










  • $begingroup$
    @darijgrinberg I understand that $A^{T}A$ is $ntext{x}n$ square matrix, and will be of min(rank $n$,rank $m$) = $n$, hence PSD. But, I am not sure, how $AA^{T}$ is PSD. Can you please throw some light?
    $endgroup$
    – kasa
    Dec 5 '18 at 19:37










2




2




$begingroup$
This problem is way asier than you think...
$endgroup$
– kimchi lover
Dec 3 '18 at 19:49




$begingroup$
This problem is way asier than you think...
$endgroup$
– kimchi lover
Dec 3 '18 at 19:49




2




2




$begingroup$
$AA^T$ is always PSD when $A$ is a real matrix.
$endgroup$
– darij grinberg
Dec 3 '18 at 19:54




$begingroup$
$AA^T$ is always PSD when $A$ is a real matrix.
$endgroup$
– darij grinberg
Dec 3 '18 at 19:54












$begingroup$
@darijgrinberg I understand that $A^{T}A$ is $ntext{x}n$ square matrix, and will be of min(rank $n$,rank $m$) = $n$, hence PSD. But, I am not sure, how $AA^{T}$ is PSD. Can you please throw some light?
$endgroup$
– kasa
Dec 5 '18 at 19:37






$begingroup$
@darijgrinberg I understand that $A^{T}A$ is $ntext{x}n$ square matrix, and will be of min(rank $n$,rank $m$) = $n$, hence PSD. But, I am not sure, how $AA^{T}$ is PSD. Can you please throw some light?
$endgroup$
– kasa
Dec 5 '18 at 19:37












0






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',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
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%2f3024377%2fgenerating-a-rectangular-matrix-a-mxn-where-aat-is-positive-semidefinit%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3024377%2fgenerating-a-rectangular-matrix-a-mxn-where-aat-is-positive-semidefinit%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Aardman Animations

Are they similar matrix