Calculate the product $A^{10}v$ where $A$ is a $2 times 2$ matrix and $v$ is a vector $[4 ; 4]^T$ [duplicate]












0















This question already has an answer here:




  • Finding a 2x2 Matrix raised to the power of 1000

    6 answers




Following on from the title, can someone suggest how to proceed with this one.



$$A=begin{bmatrix}1&1\4&1end{bmatrix}$$



and



$$v = [4 ; 4]^T?$$






linear-algebra matrix-equations







share|cite|improve this question















marked as duplicate by amd, stressed out, amWhy linear-algebra
Users with the  linear-algebra badge can single-handedly close linear-algebra questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.















  • One way could be to multiply $A$ by itself nine times then by $v$ from the right. It is pretty straightforward.
    – A.Γ.
    2 days ago


















0















This question already has an answer here:




  • Finding a 2x2 Matrix raised to the power of 1000

    6 answers




Following on from the title, can someone suggest how to proceed with this one.



$$A=begin{bmatrix}1&1\4&1end{bmatrix}$$



and



$$v = [4 ; 4]^T?$$






linear-algebra matrix-equations







share|cite|improve this question















marked as duplicate by amd, stressed out, amWhy linear-algebra
Users with the  linear-algebra badge can single-handedly close linear-algebra questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.















  • One way could be to multiply $A$ by itself nine times then by $v$ from the right. It is pretty straightforward.
    – A.Γ.
    2 days ago
















0












0








0








This question already has an answer here:




  • Finding a 2x2 Matrix raised to the power of 1000

    6 answers




Following on from the title, can someone suggest how to proceed with this one.



$$A=begin{bmatrix}1&1\4&1end{bmatrix}$$



and



$$v = [4 ; 4]^T?$$






linear-algebra matrix-equations







share|cite|improve this question
















This question already has an answer here:




  • Finding a 2x2 Matrix raised to the power of 1000

    6 answers




Following on from the title, can someone suggest how to proceed with this one.



$$A=begin{bmatrix}1&1\4&1end{bmatrix}$$



and



$$v = [4 ; 4]^T?$$





This question already has an answer here:




  • Finding a 2x2 Matrix raised to the power of 1000

    6 answers







linear-algebra matrix-equations




linear-algebra matrix-equations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago









A.Γ.

22.6k32656




22.6k32656










asked 2 days ago









RocketKangaroo

334




334




marked as duplicate by amd, stressed out, amWhy linear-algebra
Users with the  linear-algebra badge can single-handedly close linear-algebra questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.






marked as duplicate by amd, stressed out, amWhy linear-algebra
Users with the  linear-algebra badge can single-handedly close linear-algebra questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 2 days ago


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.














  • One way could be to multiply $A$ by itself nine times then by $v$ from the right. It is pretty straightforward.
    – A.Γ.
    2 days ago




















  • One way could be to multiply $A$ by itself nine times then by $v$ from the right. It is pretty straightforward.
    – A.Γ.
    2 days ago


















One way could be to multiply $A$ by itself nine times then by $v$ from the right. It is pretty straightforward.
– A.Γ.
2 days ago






One way could be to multiply $A$ by itself nine times then by $v$ from the right. It is pretty straightforward.
– A.Γ.
2 days ago












1 Answer
1






active

oldest

votes


















2














You can




  • calculate $Av$, and then apply $A$ to the result nine times;


  • or, since the eigenvalues of $A$ are distinct, $A$ is diagonalizable: there exist $P$ invertible and $D$ diagonal with $A=PDP^{-1}$. Then $A^{10}=PD^{10}P^{-1}$, where $D^{10}$ is very easy since it's diagonal.







share|cite|improve this answer

















  • 2




    That sounds very inefficient. Each time you multiply two $2times 2$ matrices you are doing 8 products and four sums; so to calculate $A^{10}$ you are doing $9times 8+2=74$ products and $9times 4+1=37$ sums, whereas if you apply $A$ to $v$ and keep doing it, each time you are doing 2 products and one sum, for a total of $10times 2=20$ products and $10times 1=10$ sums.
    – Martin Argerami
    2 days ago






  • 1




    In general, yes. But at this stage, with the 10th power, when you compare with finding the two eigenvalues, two corresponding eigenvectors, then inverting the matrix with the eigenvectors and columns, and then doing the two products in $PD^{10}P^{-1}$, "brute force" is probably less or similar work. It won't as soon as you increase powers.
    – Martin Argerami
    2 days ago








  • 1




    Yes, you are right. Contrary to what @stressedout seems to think, algorithms are not my thing :D
    – Martin Argerami
    2 days ago








  • 1




    If you compute $A^2$ and then $A^4=(A^2)^2$, you can then compute $A^2v$ followed by $A^4(A^2v)$ followed by $A^4(A^4(A^2v))$, with a total of $8+8+4+4+4=28$ multiplications and $4+4+4+2+2=14$ additions.
    – Barry Cipra
    2 days ago






  • 1




    I love how everyone is calculating the number of additions and multiplications necessary to solve this like it is actually an important problem. :P @Martin I never thought algorithms were your thing. But I said that I should never design them. :D
    – stressed out
    2 days ago


















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2














You can




  • calculate $Av$, and then apply $A$ to the result nine times;


  • or, since the eigenvalues of $A$ are distinct, $A$ is diagonalizable: there exist $P$ invertible and $D$ diagonal with $A=PDP^{-1}$. Then $A^{10}=PD^{10}P^{-1}$, where $D^{10}$ is very easy since it's diagonal.







share|cite|improve this answer

















  • 2




    That sounds very inefficient. Each time you multiply two $2times 2$ matrices you are doing 8 products and four sums; so to calculate $A^{10}$ you are doing $9times 8+2=74$ products and $9times 4+1=37$ sums, whereas if you apply $A$ to $v$ and keep doing it, each time you are doing 2 products and one sum, for a total of $10times 2=20$ products and $10times 1=10$ sums.
    – Martin Argerami
    2 days ago






  • 1




    In general, yes. But at this stage, with the 10th power, when you compare with finding the two eigenvalues, two corresponding eigenvectors, then inverting the matrix with the eigenvectors and columns, and then doing the two products in $PD^{10}P^{-1}$, "brute force" is probably less or similar work. It won't as soon as you increase powers.
    – Martin Argerami
    2 days ago








  • 1




    Yes, you are right. Contrary to what @stressedout seems to think, algorithms are not my thing :D
    – Martin Argerami
    2 days ago








  • 1




    If you compute $A^2$ and then $A^4=(A^2)^2$, you can then compute $A^2v$ followed by $A^4(A^2v)$ followed by $A^4(A^4(A^2v))$, with a total of $8+8+4+4+4=28$ multiplications and $4+4+4+2+2=14$ additions.
    – Barry Cipra
    2 days ago






  • 1




    I love how everyone is calculating the number of additions and multiplications necessary to solve this like it is actually an important problem. :P @Martin I never thought algorithms were your thing. But I said that I should never design them. :D
    – stressed out
    2 days ago
















2














You can




  • calculate $Av$, and then apply $A$ to the result nine times;


  • or, since the eigenvalues of $A$ are distinct, $A$ is diagonalizable: there exist $P$ invertible and $D$ diagonal with $A=PDP^{-1}$. Then $A^{10}=PD^{10}P^{-1}$, where $D^{10}$ is very easy since it's diagonal.







share|cite|improve this answer

















  • 2




    That sounds very inefficient. Each time you multiply two $2times 2$ matrices you are doing 8 products and four sums; so to calculate $A^{10}$ you are doing $9times 8+2=74$ products and $9times 4+1=37$ sums, whereas if you apply $A$ to $v$ and keep doing it, each time you are doing 2 products and one sum, for a total of $10times 2=20$ products and $10times 1=10$ sums.
    – Martin Argerami
    2 days ago






  • 1




    In general, yes. But at this stage, with the 10th power, when you compare with finding the two eigenvalues, two corresponding eigenvectors, then inverting the matrix with the eigenvectors and columns, and then doing the two products in $PD^{10}P^{-1}$, "brute force" is probably less or similar work. It won't as soon as you increase powers.
    – Martin Argerami
    2 days ago








  • 1




    Yes, you are right. Contrary to what @stressedout seems to think, algorithms are not my thing :D
    – Martin Argerami
    2 days ago








  • 1




    If you compute $A^2$ and then $A^4=(A^2)^2$, you can then compute $A^2v$ followed by $A^4(A^2v)$ followed by $A^4(A^4(A^2v))$, with a total of $8+8+4+4+4=28$ multiplications and $4+4+4+2+2=14$ additions.
    – Barry Cipra
    2 days ago






  • 1




    I love how everyone is calculating the number of additions and multiplications necessary to solve this like it is actually an important problem. :P @Martin I never thought algorithms were your thing. But I said that I should never design them. :D
    – stressed out
    2 days ago














2












2








2






You can




  • calculate $Av$, and then apply $A$ to the result nine times;


  • or, since the eigenvalues of $A$ are distinct, $A$ is diagonalizable: there exist $P$ invertible and $D$ diagonal with $A=PDP^{-1}$. Then $A^{10}=PD^{10}P^{-1}$, where $D^{10}$ is very easy since it's diagonal.







share|cite|improve this answer












You can




  • calculate $Av$, and then apply $A$ to the result nine times;


  • or, since the eigenvalues of $A$ are distinct, $A$ is diagonalizable: there exist $P$ invertible and $D$ diagonal with $A=PDP^{-1}$. Then $A^{10}=PD^{10}P^{-1}$, where $D^{10}$ is very easy since it's diagonal.








share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 2 days ago









Martin Argerami

124k1176174




124k1176174








  • 2




    That sounds very inefficient. Each time you multiply two $2times 2$ matrices you are doing 8 products and four sums; so to calculate $A^{10}$ you are doing $9times 8+2=74$ products and $9times 4+1=37$ sums, whereas if you apply $A$ to $v$ and keep doing it, each time you are doing 2 products and one sum, for a total of $10times 2=20$ products and $10times 1=10$ sums.
    – Martin Argerami
    2 days ago






  • 1




    In general, yes. But at this stage, with the 10th power, when you compare with finding the two eigenvalues, two corresponding eigenvectors, then inverting the matrix with the eigenvectors and columns, and then doing the two products in $PD^{10}P^{-1}$, "brute force" is probably less or similar work. It won't as soon as you increase powers.
    – Martin Argerami
    2 days ago








  • 1




    Yes, you are right. Contrary to what @stressedout seems to think, algorithms are not my thing :D
    – Martin Argerami
    2 days ago








  • 1




    If you compute $A^2$ and then $A^4=(A^2)^2$, you can then compute $A^2v$ followed by $A^4(A^2v)$ followed by $A^4(A^4(A^2v))$, with a total of $8+8+4+4+4=28$ multiplications and $4+4+4+2+2=14$ additions.
    – Barry Cipra
    2 days ago






  • 1




    I love how everyone is calculating the number of additions and multiplications necessary to solve this like it is actually an important problem. :P @Martin I never thought algorithms were your thing. But I said that I should never design them. :D
    – stressed out
    2 days ago














  • 2




    That sounds very inefficient. Each time you multiply two $2times 2$ matrices you are doing 8 products and four sums; so to calculate $A^{10}$ you are doing $9times 8+2=74$ products and $9times 4+1=37$ sums, whereas if you apply $A$ to $v$ and keep doing it, each time you are doing 2 products and one sum, for a total of $10times 2=20$ products and $10times 1=10$ sums.
    – Martin Argerami
    2 days ago






  • 1




    In general, yes. But at this stage, with the 10th power, when you compare with finding the two eigenvalues, two corresponding eigenvectors, then inverting the matrix with the eigenvectors and columns, and then doing the two products in $PD^{10}P^{-1}$, "brute force" is probably less or similar work. It won't as soon as you increase powers.
    – Martin Argerami
    2 days ago








  • 1




    Yes, you are right. Contrary to what @stressedout seems to think, algorithms are not my thing :D
    – Martin Argerami
    2 days ago








  • 1




    If you compute $A^2$ and then $A^4=(A^2)^2$, you can then compute $A^2v$ followed by $A^4(A^2v)$ followed by $A^4(A^4(A^2v))$, with a total of $8+8+4+4+4=28$ multiplications and $4+4+4+2+2=14$ additions.
    – Barry Cipra
    2 days ago






  • 1




    I love how everyone is calculating the number of additions and multiplications necessary to solve this like it is actually an important problem. :P @Martin I never thought algorithms were your thing. But I said that I should never design them. :D
    – stressed out
    2 days ago








2




2




That sounds very inefficient. Each time you multiply two $2times 2$ matrices you are doing 8 products and four sums; so to calculate $A^{10}$ you are doing $9times 8+2=74$ products and $9times 4+1=37$ sums, whereas if you apply $A$ to $v$ and keep doing it, each time you are doing 2 products and one sum, for a total of $10times 2=20$ products and $10times 1=10$ sums.
– Martin Argerami
2 days ago




That sounds very inefficient. Each time you multiply two $2times 2$ matrices you are doing 8 products and four sums; so to calculate $A^{10}$ you are doing $9times 8+2=74$ products and $9times 4+1=37$ sums, whereas if you apply $A$ to $v$ and keep doing it, each time you are doing 2 products and one sum, for a total of $10times 2=20$ products and $10times 1=10$ sums.
– Martin Argerami
2 days ago




1




1




In general, yes. But at this stage, with the 10th power, when you compare with finding the two eigenvalues, two corresponding eigenvectors, then inverting the matrix with the eigenvectors and columns, and then doing the two products in $PD^{10}P^{-1}$, "brute force" is probably less or similar work. It won't as soon as you increase powers.
– Martin Argerami
2 days ago






In general, yes. But at this stage, with the 10th power, when you compare with finding the two eigenvalues, two corresponding eigenvectors, then inverting the matrix with the eigenvectors and columns, and then doing the two products in $PD^{10}P^{-1}$, "brute force" is probably less or similar work. It won't as soon as you increase powers.
– Martin Argerami
2 days ago






1




1




Yes, you are right. Contrary to what @stressedout seems to think, algorithms are not my thing :D
– Martin Argerami
2 days ago






Yes, you are right. Contrary to what @stressedout seems to think, algorithms are not my thing :D
– Martin Argerami
2 days ago






1




1




If you compute $A^2$ and then $A^4=(A^2)^2$, you can then compute $A^2v$ followed by $A^4(A^2v)$ followed by $A^4(A^4(A^2v))$, with a total of $8+8+4+4+4=28$ multiplications and $4+4+4+2+2=14$ additions.
– Barry Cipra
2 days ago




If you compute $A^2$ and then $A^4=(A^2)^2$, you can then compute $A^2v$ followed by $A^4(A^2v)$ followed by $A^4(A^4(A^2v))$, with a total of $8+8+4+4+4=28$ multiplications and $4+4+4+2+2=14$ additions.
– Barry Cipra
2 days ago




1




1




I love how everyone is calculating the number of additions and multiplications necessary to solve this like it is actually an important problem. :P @Martin I never thought algorithms were your thing. But I said that I should never design them. :D
– stressed out
2 days ago




I love how everyone is calculating the number of additions and multiplications necessary to solve this like it is actually an important problem. :P @Martin I never thought algorithms were your thing. But I said that I should never design them. :D
– stressed out
2 days ago



-

Popular posts from this blog

1300-talet

Image
Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
Read more

1300-talet

Image
Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
Read more

Display a custom attribute below product name in the front-end Magento 1.9.3.8

Image
0 I need to display a custom attribute bellow the product name and I don't know how can I call this attribute. I am editing the file /app/design/frontend/templatemela/MAG100219_1/template/catalog/product/view.phtml But how can I call this attribute in php? I tried calling a string echo with the name I put in the attribute, but it didn't work. Code is as below: <div class="page-title product-title"> <h1><?php echo $_helper->productAttribute($_product, $_product->getName(), 'name') ?></h1> </div> <div class="codigoinmetro"> <h2><?php echo $_helper->productAttribute($_product, $_product->getName(), 'registroinmetro') ?></h2> </div> php attrib...
Read more