Solve for the exponent of a matrix












2












$begingroup$


we discussed matrices in class and had the following task: Given



$$U=begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0\1 & frac{1}{15} & 0 & 0 & 0 &0\0 & frac{8}{15} & frac{3}{15} & 0 & 0 & 0\0 & frac{6}{15} & frac{9}{15} & frac{6}{15} & 0 & 0\ 0 & 0 & frac{3}{15} & frac{8}{15} & frac{10}{15} & 0\0 & 0 & 0 & frac{1}{15} & frac{5}{15} & 1end{bmatrix},
quad overrightarrow{s}=begin{bmatrix}1\0\0\0\0\0end{bmatrix},$$



solve for $x$ such that $U^xoverrightarrow{s}=overrightarrow{s_x}$ where the last element (Row) of $overrightarrow{s_x}$ should be equal or greater than 0.99.



We were told that the only way to get $x$ is by inserting random numbers and "search" for it. By doing this we actually found:



$$overrightarrow{s_{15}}=begin{bmatrix}0\0\0\0\0,0137\0,9863end{bmatrix},quad overrightarrow{s_{16}}=begin{bmatrix}0\0\0\0\0,0091\0,9909end{bmatrix}.$$



So the answer is pretty much $x=16$, but is there no way to solve for $x$ instead of inserting random numbers until you find the answer?



Thanks for any answers










share|cite|improve this question











$endgroup$












  • $begingroup$
    Is $overrightarrow{s}$ a column vector? If so how can the top element of the product be $1,$ as all entries of top row of matrix are $0$ ?
    $endgroup$
    – coffeemath
    Dec 5 '18 at 13:36












  • $begingroup$
    yes $overrightarrow{s}$ is a column vector. Can you clarify what you mean with the top element of the product is 1? The product of $U^{15}*overrightarrow{s}=overrightarrow{s_{15}}$
    $endgroup$
    – Alex F
    Dec 5 '18 at 13:42










  • $begingroup$
    Oh I get it... the definitions were so close in question it looked like the matrix was multiplying the column vector. But it's just two separate equations, one for what U is, and one for what s is.
    $endgroup$
    – coffeemath
    Dec 5 '18 at 14:06












  • $begingroup$
    On that note, I've edited your question so as to make it more clear visually.
    $endgroup$
    – Semiclassical
    Dec 5 '18 at 14:08










  • $begingroup$
    Thank you very much @Semiclassical Iam new to this page, so Iam just getting used to the formatting, but that's really nice of you! :) Thanks for taking that time
    $endgroup$
    – Alex F
    Dec 5 '18 at 14:10
















2












$begingroup$


we discussed matrices in class and had the following task: Given



$$U=begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0\1 & frac{1}{15} & 0 & 0 & 0 &0\0 & frac{8}{15} & frac{3}{15} & 0 & 0 & 0\0 & frac{6}{15} & frac{9}{15} & frac{6}{15} & 0 & 0\ 0 & 0 & frac{3}{15} & frac{8}{15} & frac{10}{15} & 0\0 & 0 & 0 & frac{1}{15} & frac{5}{15} & 1end{bmatrix},
quad overrightarrow{s}=begin{bmatrix}1\0\0\0\0\0end{bmatrix},$$



solve for $x$ such that $U^xoverrightarrow{s}=overrightarrow{s_x}$ where the last element (Row) of $overrightarrow{s_x}$ should be equal or greater than 0.99.



We were told that the only way to get $x$ is by inserting random numbers and "search" for it. By doing this we actually found:



$$overrightarrow{s_{15}}=begin{bmatrix}0\0\0\0\0,0137\0,9863end{bmatrix},quad overrightarrow{s_{16}}=begin{bmatrix}0\0\0\0\0,0091\0,9909end{bmatrix}.$$



So the answer is pretty much $x=16$, but is there no way to solve for $x$ instead of inserting random numbers until you find the answer?



Thanks for any answers










share|cite|improve this question











$endgroup$












  • $begingroup$
    Is $overrightarrow{s}$ a column vector? If so how can the top element of the product be $1,$ as all entries of top row of matrix are $0$ ?
    $endgroup$
    – coffeemath
    Dec 5 '18 at 13:36












  • $begingroup$
    yes $overrightarrow{s}$ is a column vector. Can you clarify what you mean with the top element of the product is 1? The product of $U^{15}*overrightarrow{s}=overrightarrow{s_{15}}$
    $endgroup$
    – Alex F
    Dec 5 '18 at 13:42










  • $begingroup$
    Oh I get it... the definitions were so close in question it looked like the matrix was multiplying the column vector. But it's just two separate equations, one for what U is, and one for what s is.
    $endgroup$
    – coffeemath
    Dec 5 '18 at 14:06












  • $begingroup$
    On that note, I've edited your question so as to make it more clear visually.
    $endgroup$
    – Semiclassical
    Dec 5 '18 at 14:08










  • $begingroup$
    Thank you very much @Semiclassical Iam new to this page, so Iam just getting used to the formatting, but that's really nice of you! :) Thanks for taking that time
    $endgroup$
    – Alex F
    Dec 5 '18 at 14:10














2












2








2


1



$begingroup$


we discussed matrices in class and had the following task: Given



$$U=begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0\1 & frac{1}{15} & 0 & 0 & 0 &0\0 & frac{8}{15} & frac{3}{15} & 0 & 0 & 0\0 & frac{6}{15} & frac{9}{15} & frac{6}{15} & 0 & 0\ 0 & 0 & frac{3}{15} & frac{8}{15} & frac{10}{15} & 0\0 & 0 & 0 & frac{1}{15} & frac{5}{15} & 1end{bmatrix},
quad overrightarrow{s}=begin{bmatrix}1\0\0\0\0\0end{bmatrix},$$



solve for $x$ such that $U^xoverrightarrow{s}=overrightarrow{s_x}$ where the last element (Row) of $overrightarrow{s_x}$ should be equal or greater than 0.99.



We were told that the only way to get $x$ is by inserting random numbers and "search" for it. By doing this we actually found:



$$overrightarrow{s_{15}}=begin{bmatrix}0\0\0\0\0,0137\0,9863end{bmatrix},quad overrightarrow{s_{16}}=begin{bmatrix}0\0\0\0\0,0091\0,9909end{bmatrix}.$$



So the answer is pretty much $x=16$, but is there no way to solve for $x$ instead of inserting random numbers until you find the answer?



Thanks for any answers










share|cite|improve this question











$endgroup$




we discussed matrices in class and had the following task: Given



$$U=begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0\1 & frac{1}{15} & 0 & 0 & 0 &0\0 & frac{8}{15} & frac{3}{15} & 0 & 0 & 0\0 & frac{6}{15} & frac{9}{15} & frac{6}{15} & 0 & 0\ 0 & 0 & frac{3}{15} & frac{8}{15} & frac{10}{15} & 0\0 & 0 & 0 & frac{1}{15} & frac{5}{15} & 1end{bmatrix},
quad overrightarrow{s}=begin{bmatrix}1\0\0\0\0\0end{bmatrix},$$



solve for $x$ such that $U^xoverrightarrow{s}=overrightarrow{s_x}$ where the last element (Row) of $overrightarrow{s_x}$ should be equal or greater than 0.99.



We were told that the only way to get $x$ is by inserting random numbers and "search" for it. By doing this we actually found:



$$overrightarrow{s_{15}}=begin{bmatrix}0\0\0\0\0,0137\0,9863end{bmatrix},quad overrightarrow{s_{16}}=begin{bmatrix}0\0\0\0\0,0091\0,9909end{bmatrix}.$$



So the answer is pretty much $x=16$, but is there no way to solve for $x$ instead of inserting random numbers until you find the answer?



Thanks for any answers







linear-algebra matrices inequality matrix-equations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 5 '18 at 14:07









Semiclassical

11.1k32465




11.1k32465










asked Dec 5 '18 at 13:25









Alex FAlex F

132




132












  • $begingroup$
    Is $overrightarrow{s}$ a column vector? If so how can the top element of the product be $1,$ as all entries of top row of matrix are $0$ ?
    $endgroup$
    – coffeemath
    Dec 5 '18 at 13:36












  • $begingroup$
    yes $overrightarrow{s}$ is a column vector. Can you clarify what you mean with the top element of the product is 1? The product of $U^{15}*overrightarrow{s}=overrightarrow{s_{15}}$
    $endgroup$
    – Alex F
    Dec 5 '18 at 13:42










  • $begingroup$
    Oh I get it... the definitions were so close in question it looked like the matrix was multiplying the column vector. But it's just two separate equations, one for what U is, and one for what s is.
    $endgroup$
    – coffeemath
    Dec 5 '18 at 14:06












  • $begingroup$
    On that note, I've edited your question so as to make it more clear visually.
    $endgroup$
    – Semiclassical
    Dec 5 '18 at 14:08










  • $begingroup$
    Thank you very much @Semiclassical Iam new to this page, so Iam just getting used to the formatting, but that's really nice of you! :) Thanks for taking that time
    $endgroup$
    – Alex F
    Dec 5 '18 at 14:10


















  • $begingroup$
    Is $overrightarrow{s}$ a column vector? If so how can the top element of the product be $1,$ as all entries of top row of matrix are $0$ ?
    $endgroup$
    – coffeemath
    Dec 5 '18 at 13:36












  • $begingroup$
    yes $overrightarrow{s}$ is a column vector. Can you clarify what you mean with the top element of the product is 1? The product of $U^{15}*overrightarrow{s}=overrightarrow{s_{15}}$
    $endgroup$
    – Alex F
    Dec 5 '18 at 13:42










  • $begingroup$
    Oh I get it... the definitions were so close in question it looked like the matrix was multiplying the column vector. But it's just two separate equations, one for what U is, and one for what s is.
    $endgroup$
    – coffeemath
    Dec 5 '18 at 14:06












  • $begingroup$
    On that note, I've edited your question so as to make it more clear visually.
    $endgroup$
    – Semiclassical
    Dec 5 '18 at 14:08










  • $begingroup$
    Thank you very much @Semiclassical Iam new to this page, so Iam just getting used to the formatting, but that's really nice of you! :) Thanks for taking that time
    $endgroup$
    – Alex F
    Dec 5 '18 at 14:10
















$begingroup$
Is $overrightarrow{s}$ a column vector? If so how can the top element of the product be $1,$ as all entries of top row of matrix are $0$ ?
$endgroup$
– coffeemath
Dec 5 '18 at 13:36






$begingroup$
Is $overrightarrow{s}$ a column vector? If so how can the top element of the product be $1,$ as all entries of top row of matrix are $0$ ?
$endgroup$
– coffeemath
Dec 5 '18 at 13:36














$begingroup$
yes $overrightarrow{s}$ is a column vector. Can you clarify what you mean with the top element of the product is 1? The product of $U^{15}*overrightarrow{s}=overrightarrow{s_{15}}$
$endgroup$
– Alex F
Dec 5 '18 at 13:42




$begingroup$
yes $overrightarrow{s}$ is a column vector. Can you clarify what you mean with the top element of the product is 1? The product of $U^{15}*overrightarrow{s}=overrightarrow{s_{15}}$
$endgroup$
– Alex F
Dec 5 '18 at 13:42












$begingroup$
Oh I get it... the definitions were so close in question it looked like the matrix was multiplying the column vector. But it's just two separate equations, one for what U is, and one for what s is.
$endgroup$
– coffeemath
Dec 5 '18 at 14:06






$begingroup$
Oh I get it... the definitions were so close in question it looked like the matrix was multiplying the column vector. But it's just two separate equations, one for what U is, and one for what s is.
$endgroup$
– coffeemath
Dec 5 '18 at 14:06














$begingroup$
On that note, I've edited your question so as to make it more clear visually.
$endgroup$
– Semiclassical
Dec 5 '18 at 14:08




$begingroup$
On that note, I've edited your question so as to make it more clear visually.
$endgroup$
– Semiclassical
Dec 5 '18 at 14:08












$begingroup$
Thank you very much @Semiclassical Iam new to this page, so Iam just getting used to the formatting, but that's really nice of you! :) Thanks for taking that time
$endgroup$
– Alex F
Dec 5 '18 at 14:10




$begingroup$
Thank you very much @Semiclassical Iam new to this page, so Iam just getting used to the formatting, but that's really nice of you! :) Thanks for taking that time
$endgroup$
– Alex F
Dec 5 '18 at 14:10










1 Answer
1






active

oldest

votes


















1












$begingroup$

Hint :



Using this you get the diagonalization of $U=PDP^{-1}$, then $U^x = PDP^{-1} dots PDP^{-1} = P D^x P^{-1}$ where $D$ is the matrix with the elements of $D$ elevated to power $x$. Using this you can solve for the last element being greater to $0.99$






share|cite|improve this answer









$endgroup$













  • $begingroup$
    i actually found a function that does exactly what i want with your approach. Thank you very much for this answer! really useful
    $endgroup$
    – Alex F
    Dec 5 '18 at 16:32











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%2f3027061%2fsolve-for-the-exponent-of-a-matrix%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

Hint :



Using this you get the diagonalization of $U=PDP^{-1}$, then $U^x = PDP^{-1} dots PDP^{-1} = P D^x P^{-1}$ where $D$ is the matrix with the elements of $D$ elevated to power $x$. Using this you can solve for the last element being greater to $0.99$






share|cite|improve this answer









$endgroup$













  • $begingroup$
    i actually found a function that does exactly what i want with your approach. Thank you very much for this answer! really useful
    $endgroup$
    – Alex F
    Dec 5 '18 at 16:32
















1












$begingroup$

Hint :



Using this you get the diagonalization of $U=PDP^{-1}$, then $U^x = PDP^{-1} dots PDP^{-1} = P D^x P^{-1}$ where $D$ is the matrix with the elements of $D$ elevated to power $x$. Using this you can solve for the last element being greater to $0.99$






share|cite|improve this answer









$endgroup$













  • $begingroup$
    i actually found a function that does exactly what i want with your approach. Thank you very much for this answer! really useful
    $endgroup$
    – Alex F
    Dec 5 '18 at 16:32














1












1








1





$begingroup$

Hint :



Using this you get the diagonalization of $U=PDP^{-1}$, then $U^x = PDP^{-1} dots PDP^{-1} = P D^x P^{-1}$ where $D$ is the matrix with the elements of $D$ elevated to power $x$. Using this you can solve for the last element being greater to $0.99$






share|cite|improve this answer









$endgroup$



Hint :



Using this you get the diagonalization of $U=PDP^{-1}$, then $U^x = PDP^{-1} dots PDP^{-1} = P D^x P^{-1}$ where $D$ is the matrix with the elements of $D$ elevated to power $x$. Using this you can solve for the last element being greater to $0.99$







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 5 '18 at 13:55









P. QuintonP. Quinton

1,7261213




1,7261213












  • $begingroup$
    i actually found a function that does exactly what i want with your approach. Thank you very much for this answer! really useful
    $endgroup$
    – Alex F
    Dec 5 '18 at 16:32


















  • $begingroup$
    i actually found a function that does exactly what i want with your approach. Thank you very much for this answer! really useful
    $endgroup$
    – Alex F
    Dec 5 '18 at 16:32
















$begingroup$
i actually found a function that does exactly what i want with your approach. Thank you very much for this answer! really useful
$endgroup$
– Alex F
Dec 5 '18 at 16:32




$begingroup$
i actually found a function that does exactly what i want with your approach. Thank you very much for this answer! really useful
$endgroup$
– Alex F
Dec 5 '18 at 16:32


















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%2f3027061%2fsolve-for-the-exponent-of-a-matrix%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

Aardman Animations

Are they similar matrix

“minimization” problem in Euclidean space related to orthonormal basis