Iteration on a matrix
I want to update "matrix1" 100 times. "matrix3" will be new "matrix1" and it will iterate 100 times. Should I use a loop or function? First iteration is:
matrix1 = ( {
{1, 2, 3},
{4, 5, 6},
{7, 8, 9}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (First iteration):
{{6, 8, 10}, {12, 14, 16}, {18, 20, 22}}
matrix3 will be new matrix1
matrix1 = ( {
{6, 8, 10},
{12, 14, 16},
{18, 20, 22}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (Second iteration):
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
And, It will repeat 100 times.
matrix education iteration
add a comment |
I want to update "matrix1" 100 times. "matrix3" will be new "matrix1" and it will iterate 100 times. Should I use a loop or function? First iteration is:
matrix1 = ( {
{1, 2, 3},
{4, 5, 6},
{7, 8, 9}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (First iteration):
{{6, 8, 10}, {12, 14, 16}, {18, 20, 22}}
matrix3 will be new matrix1
matrix1 = ( {
{6, 8, 10},
{12, 14, 16},
{18, 20, 22}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (Second iteration):
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
And, It will repeat 100 times.
matrix education iteration
add a comment |
I want to update "matrix1" 100 times. "matrix3" will be new "matrix1" and it will iterate 100 times. Should I use a loop or function? First iteration is:
matrix1 = ( {
{1, 2, 3},
{4, 5, 6},
{7, 8, 9}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (First iteration):
{{6, 8, 10}, {12, 14, 16}, {18, 20, 22}}
matrix3 will be new matrix1
matrix1 = ( {
{6, 8, 10},
{12, 14, 16},
{18, 20, 22}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (Second iteration):
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
And, It will repeat 100 times.
matrix education iteration
I want to update "matrix1" 100 times. "matrix3" will be new "matrix1" and it will iterate 100 times. Should I use a loop or function? First iteration is:
matrix1 = ( {
{1, 2, 3},
{4, 5, 6},
{7, 8, 9}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (First iteration):
{{6, 8, 10}, {12, 14, 16}, {18, 20, 22}}
matrix3 will be new matrix1
matrix1 = ( {
{6, 8, 10},
{12, 14, 16},
{18, 20, 22}
} );
matrix2 = matrix1*2 - 1;
matrix3 = matrix2 + 5;
matrix3
Output (Second iteration):
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
And, It will repeat 100 times.
matrix education iteration
matrix education iteration
edited Dec 17 at 14:16
Αλέξανδρος Ζεγγ
4,0421928
4,0421928
asked Dec 16 at 20:01
ithilquessirr
644
644
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
NestList[x [Function] 2 x + 4, {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}, 100]
add a comment |
Another possibility is to write the problem via a recursion:
f[n_] := 2 f[n - 1] + 4;
f[1] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
To get any power, you then ask for
f[3]
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
or
f[100]
add a comment |
Just for illustration and learning reasons, three examples with Fold
, Do
and Table
. Define
matrix1 := {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}
Then
Table[matrix1 = 2*matrix1 + 4, {100}]
prints all intermediate matrices
Do[matrix1 = 2*matrix1 + 4, {100}]
matrix1
and
f[x_] := 2 x + 4
Fold[f[#1] &, matrix1, Range[100]]
print the last result.
add a comment |
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: "387"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
},
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%2fmathematica.stackexchange.com%2fquestions%2f188004%2fiteration-on-a-matrix%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
NestList[x [Function] 2 x + 4, {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}, 100]
add a comment |
NestList[x [Function] 2 x + 4, {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}, 100]
add a comment |
NestList[x [Function] 2 x + 4, {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}, 100]
NestList[x [Function] 2 x + 4, {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}, 100]
answered Dec 16 at 20:11
Henrik Schumacher
48.1k466135
48.1k466135
add a comment |
add a comment |
Another possibility is to write the problem via a recursion:
f[n_] := 2 f[n - 1] + 4;
f[1] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
To get any power, you then ask for
f[3]
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
or
f[100]
add a comment |
Another possibility is to write the problem via a recursion:
f[n_] := 2 f[n - 1] + 4;
f[1] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
To get any power, you then ask for
f[3]
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
or
f[100]
add a comment |
Another possibility is to write the problem via a recursion:
f[n_] := 2 f[n - 1] + 4;
f[1] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
To get any power, you then ask for
f[3]
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
or
f[100]
Another possibility is to write the problem via a recursion:
f[n_] := 2 f[n - 1] + 4;
f[1] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
To get any power, you then ask for
f[3]
{{16, 20, 24}, {28, 32, 36}, {40, 44, 48}}
or
f[100]
answered Dec 16 at 21:51
bill s
52.7k375150
52.7k375150
add a comment |
add a comment |
Just for illustration and learning reasons, three examples with Fold
, Do
and Table
. Define
matrix1 := {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}
Then
Table[matrix1 = 2*matrix1 + 4, {100}]
prints all intermediate matrices
Do[matrix1 = 2*matrix1 + 4, {100}]
matrix1
and
f[x_] := 2 x + 4
Fold[f[#1] &, matrix1, Range[100]]
print the last result.
add a comment |
Just for illustration and learning reasons, three examples with Fold
, Do
and Table
. Define
matrix1 := {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}
Then
Table[matrix1 = 2*matrix1 + 4, {100}]
prints all intermediate matrices
Do[matrix1 = 2*matrix1 + 4, {100}]
matrix1
and
f[x_] := 2 x + 4
Fold[f[#1] &, matrix1, Range[100]]
print the last result.
add a comment |
Just for illustration and learning reasons, three examples with Fold
, Do
and Table
. Define
matrix1 := {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}
Then
Table[matrix1 = 2*matrix1 + 4, {100}]
prints all intermediate matrices
Do[matrix1 = 2*matrix1 + 4, {100}]
matrix1
and
f[x_] := 2 x + 4
Fold[f[#1] &, matrix1, Range[100]]
print the last result.
Just for illustration and learning reasons, three examples with Fold
, Do
and Table
. Define
matrix1 := {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}
Then
Table[matrix1 = 2*matrix1 + 4, {100}]
prints all intermediate matrices
Do[matrix1 = 2*matrix1 + 4, {100}]
matrix1
and
f[x_] := 2 x + 4
Fold[f[#1] &, matrix1, Range[100]]
print the last result.
edited Dec 17 at 13:43
answered Dec 16 at 20:44
Titus
550317
550317
add a comment |
add a comment |
Thanks for contributing an answer to Mathematica 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%2fmathematica.stackexchange.com%2fquestions%2f188004%2fiteration-on-a-matrix%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