Mixing
Find minimal spanning subset of a set for another set efficiently
Correct me if my terminology is wrong since I'm not very good at formal math.
I know minimal spanning set is the smallest set of vectors that spans the row space of a matrix, but how can I restrict the spanning set to be the subset of another set?
For example, I have two matrices:
$A$: 1600 by 16 integer matrix
$B$: 4 by 16 integer matrix
I want to find minimal number of rows in $A$ such that they span $B$. Is there any terms related to that? How to find those rows efficiently? I know the minimal number should be at least 4 and somewhere around 7. Trying all possibilities is definitely not an option because the search space is too big.
linear-algebra matrices algorithms matrix-rank
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
add a comment |
Correct me if my terminology is wrong since I'm not very good at formal math.
I know minimal spanning set is the smallest set of vectors that spans the row space of a matrix, but how can I restrict the spanning set to be the subset of another set?
For example, I have two matrices:
$A$: 1600 by 16 integer matrix
$B$: 4 by 16 integer matrix
I want to find minimal number of rows in $A$ such that they span $B$. Is there any terms related to that? How to find those rows efficiently? I know the minimal number should be at least 4 and somewhere around 7. Trying all possibilities is definitely not an option because the search space is too big.
linear-algebra matrices algorithms matrix-rank
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
add a comment |
Correct me if my terminology is wrong since I'm not very good at formal math.
I know minimal spanning set is the smallest set of vectors that spans the row space of a matrix, but how can I restrict the spanning set to be the subset of another set?
For example, I have two matrices:
$A$: 1600 by 16 integer matrix
$B$: 4 by 16 integer matrix
I want to find minimal number of rows in $A$ such that they span $B$. Is there any terms related to that? How to find those rows efficiently? I know the minimal number should be at least 4 and somewhere around 7. Trying all possibilities is definitely not an option because the search space is too big.
linear-algebra matrices algorithms matrix-rank
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
Correct me if my terminology is wrong since I'm not very good at formal math.
I know minimal spanning set is the smallest set of vectors that spans the row space of a matrix, but how can I restrict the spanning set to be the subset of another set?
For example, I have two matrices:
$A$: 1600 by 16 integer matrix
$B$: 4 by 16 integer matrix
I want to find minimal number of rows in $A$ such that they span $B$. Is there any terms related to that? How to find those rows efficiently? I know the minimal number should be at least 4 and somewhere around 7. Trying all possibilities is definitely not an option because the search space is too big.
linear-algebra matrices algorithms matrix-rank
linear-algebra matrices algorithms matrix-rank
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
asked Nov 21 '18 at 7:15
ZisIsNotZis
1064
1064
add a comment |
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007375%2ffind-minimal-spanning-subset-of-a-set-for-another-set-efficiently%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
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007375%2ffind-minimal-spanning-subset-of-a-set-for-another-set-efficiently%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
