Is there a shortcut to find if system of linear equations has infinite or unique solution
0
$begingroup$
I got an example here from math stack exchange it uses matrices to determine whether the equation has unique or infinite solution. Is there any shortcut way to determine the same without having to take the matrices track? Can you post a reference to such shortcut solution?
linear-algebra matrices
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
$endgroup$
add a comment |
0
$begingroup$
I got an example here from math stack exchange it uses matrices to determine whether the equation has unique or infinite solution. Is there any shortcut way to determine the same without having to take the matrices track? Can you post a reference to such shortcut solution?
linear-algebra matrices
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
$endgroup$
4
$begingroup$
Short answer: no. Slightly longer answer: I've never heard of any more efficient methods. Such methods would be of extreme interest to a lot of people, so I highly doubt they exist (or, they're complex enough that you'd only get a very slight gain for extremely large cases).
$endgroup$
– Theo Bendit
Jan 4 at 7:51
2
$begingroup$
Also, don't be afraid of matrices. It's just standard elimination techniques (which are more efficient than substitution) written with a minimum of notation.
$endgroup$
– Theo Bendit
Jan 4 at 7:53
add a comment |
0
0
0
$begingroup$
I got an example here from math stack exchange it uses matrices to determine whether the equation has unique or infinite solution. Is there any shortcut way to determine the same without having to take the matrices track? Can you post a reference to such shortcut solution?
linear-algebra matrices
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
$endgroup$
I got an example here from math stack exchange it uses matrices to determine whether the equation has unique or infinite solution. Is there any shortcut way to determine the same without having to take the matrices track? Can you post a reference to such shortcut solution?
linear-algebra matrices
linear-algebra matrices
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
asked Jan 4 at 7:42
Shaikh SakibShaikh Sakib
195
195
4
$begingroup$
Short answer: no. Slightly longer answer: I've never heard of any more efficient methods. Such methods would be of extreme interest to a lot of people, so I highly doubt they exist (or, they're complex enough that you'd only get a very slight gain for extremely large cases).
$endgroup$
– Theo Bendit
Jan 4 at 7:51
2
$begingroup$
Also, don't be afraid of matrices. It's just standard elimination techniques (which are more efficient than substitution) written with a minimum of notation.
$endgroup$
– Theo Bendit
Jan 4 at 7:53
add a comment |
4
$begingroup$
Short answer: no. Slightly longer answer: I've never heard of any more efficient methods. Such methods would be of extreme interest to a lot of people, so I highly doubt they exist (or, they're complex enough that you'd only get a very slight gain for extremely large cases).
$endgroup$
– Theo Bendit
Jan 4 at 7:51
2
$begingroup$
Also, don't be afraid of matrices. It's just standard elimination techniques (which are more efficient than substitution) written with a minimum of notation.
$endgroup$
– Theo Bendit
Jan 4 at 7:53
4
4
$begingroup$
Short answer: no. Slightly longer answer: I've never heard of any more efficient methods. Such methods would be of extreme interest to a lot of people, so I highly doubt they exist (or, they're complex enough that you'd only get a very slight gain for extremely large cases).
$endgroup$
– Theo Bendit
Jan 4 at 7:51
$begingroup$
Short answer: no. Slightly longer answer: I've never heard of any more efficient methods. Such methods would be of extreme interest to a lot of people, so I highly doubt they exist (or, they're complex enough that you'd only get a very slight gain for extremely large cases).
$endgroup$
– Theo Bendit
Jan 4 at 7:51
2
2
$begingroup$
Also, don't be afraid of matrices. It's just standard elimination techniques (which are more efficient than substitution) written with a minimum of notation.
$endgroup$
– Theo Bendit
Jan 4 at 7:53
$begingroup$
Also, don't be afraid of matrices. It's just standard elimination techniques (which are more efficient than substitution) written with a minimum of notation.
$endgroup$
– Theo Bendit
Jan 4 at 7:53
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
});
}
});
draft saved
draft discarded
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%2f3061403%2fis-there-a-shortcut-to-find-if-system-of-linear-equations-has-infinite-or-unique%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
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%2f3061403%2fis-there-a-shortcut-to-find-if-system-of-linear-equations-has-infinite-or-unique%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
4
$begingroup$
Short answer: no. Slightly longer answer: I've never heard of any more efficient methods. Such methods would be of extreme interest to a lot of people, so I highly doubt they exist (or, they're complex enough that you'd only get a very slight gain for extremely large cases).
$endgroup$
– Theo Bendit
Jan 4 at 7:51
2
$begingroup$
Also, don't be afraid of matrices. It's just standard elimination techniques (which are more efficient than substitution) written with a minimum of notation.
$endgroup$
– Theo Bendit
Jan 4 at 7:53