Picard Iteration/ index












0














i have the following System of Differential Equations
$$ begin{pmatrix}
x'(t) \
y'(t)
end{pmatrix} = begin{pmatrix}
0 && 1\
-1 && 0
end{pmatrix} begin{pmatrix}
x(t) \
y(t)
end{pmatrix} and begin{pmatrix}
x(0) \
y(0)
end{pmatrix}= begin{pmatrix}
2 \
0
end{pmatrix} $$

When i use the Picard-Iteration, i get ($ s:= begin{pmatrix}
x(t) \
y(t)end{pmatrix} $
)
$$ s_1 = begin{pmatrix}
2 \
-2tend{pmatrix} $$

$$ s_2 = begin{pmatrix}
2-t^2 \
-2tend{pmatrix} $$

$$ s_3 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $$

I assume that $ s_{infty} = begin{pmatrix}
2cos t \
-2sint end{pmatrix} $

But when i consider the series for sin and cos, for example for the index 1, $ s_1$ will be $ s_1 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $

How do i get this right?










share|cite|improve this question




















  • 2




    Writing $x(x)$ is confusing (even mildly infuriating), so please use $x(t)$ or something similar.
    – MisterRiemann
    Nov 24 at 15:26












  • I changed it. I am sorry.
    – Steven33
    Nov 24 at 16:53










  • You get the linear terms correct in the first integration, the quadratic terms in the second, and the cubic terms in the third integration. Why do you think you could get (correct or at all) cubic terms in the first integration?
    – LutzL
    Nov 24 at 17:21










  • I mean it differently. When i consider, $ 2 cos t = sum_{k=0}^{infty} frac{(-1)^k t^{2k} }{(2k)!} $, then i get for k=1: $ 2- t^2 ne s_{11}=2$ Dont i have to get the indices synchronised?
    – Steven33
    Nov 24 at 17:34


















0














i have the following System of Differential Equations
$$ begin{pmatrix}
x'(t) \
y'(t)
end{pmatrix} = begin{pmatrix}
0 && 1\
-1 && 0
end{pmatrix} begin{pmatrix}
x(t) \
y(t)
end{pmatrix} and begin{pmatrix}
x(0) \
y(0)
end{pmatrix}= begin{pmatrix}
2 \
0
end{pmatrix} $$

When i use the Picard-Iteration, i get ($ s:= begin{pmatrix}
x(t) \
y(t)end{pmatrix} $
)
$$ s_1 = begin{pmatrix}
2 \
-2tend{pmatrix} $$

$$ s_2 = begin{pmatrix}
2-t^2 \
-2tend{pmatrix} $$

$$ s_3 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $$

I assume that $ s_{infty} = begin{pmatrix}
2cos t \
-2sint end{pmatrix} $

But when i consider the series for sin and cos, for example for the index 1, $ s_1$ will be $ s_1 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $

How do i get this right?










share|cite|improve this question




















  • 2




    Writing $x(x)$ is confusing (even mildly infuriating), so please use $x(t)$ or something similar.
    – MisterRiemann
    Nov 24 at 15:26












  • I changed it. I am sorry.
    – Steven33
    Nov 24 at 16:53










  • You get the linear terms correct in the first integration, the quadratic terms in the second, and the cubic terms in the third integration. Why do you think you could get (correct or at all) cubic terms in the first integration?
    – LutzL
    Nov 24 at 17:21










  • I mean it differently. When i consider, $ 2 cos t = sum_{k=0}^{infty} frac{(-1)^k t^{2k} }{(2k)!} $, then i get for k=1: $ 2- t^2 ne s_{11}=2$ Dont i have to get the indices synchronised?
    – Steven33
    Nov 24 at 17:34
















0












0








0







i have the following System of Differential Equations
$$ begin{pmatrix}
x'(t) \
y'(t)
end{pmatrix} = begin{pmatrix}
0 && 1\
-1 && 0
end{pmatrix} begin{pmatrix}
x(t) \
y(t)
end{pmatrix} and begin{pmatrix}
x(0) \
y(0)
end{pmatrix}= begin{pmatrix}
2 \
0
end{pmatrix} $$

When i use the Picard-Iteration, i get ($ s:= begin{pmatrix}
x(t) \
y(t)end{pmatrix} $
)
$$ s_1 = begin{pmatrix}
2 \
-2tend{pmatrix} $$

$$ s_2 = begin{pmatrix}
2-t^2 \
-2tend{pmatrix} $$

$$ s_3 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $$

I assume that $ s_{infty} = begin{pmatrix}
2cos t \
-2sint end{pmatrix} $

But when i consider the series for sin and cos, for example for the index 1, $ s_1$ will be $ s_1 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $

How do i get this right?










share|cite|improve this question















i have the following System of Differential Equations
$$ begin{pmatrix}
x'(t) \
y'(t)
end{pmatrix} = begin{pmatrix}
0 && 1\
-1 && 0
end{pmatrix} begin{pmatrix}
x(t) \
y(t)
end{pmatrix} and begin{pmatrix}
x(0) \
y(0)
end{pmatrix}= begin{pmatrix}
2 \
0
end{pmatrix} $$

When i use the Picard-Iteration, i get ($ s:= begin{pmatrix}
x(t) \
y(t)end{pmatrix} $
)
$$ s_1 = begin{pmatrix}
2 \
-2tend{pmatrix} $$

$$ s_2 = begin{pmatrix}
2-t^2 \
-2tend{pmatrix} $$

$$ s_3 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $$

I assume that $ s_{infty} = begin{pmatrix}
2cos t \
-2sint end{pmatrix} $

But when i consider the series for sin and cos, for example for the index 1, $ s_1$ will be $ s_1 = begin{pmatrix}
2-t^2 \
frac{1}{3} t^3-2tend{pmatrix} $

How do i get this right?







differential-equations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 24 at 15:33

























asked Nov 24 at 15:24









Steven33

144




144








  • 2




    Writing $x(x)$ is confusing (even mildly infuriating), so please use $x(t)$ or something similar.
    – MisterRiemann
    Nov 24 at 15:26












  • I changed it. I am sorry.
    – Steven33
    Nov 24 at 16:53










  • You get the linear terms correct in the first integration, the quadratic terms in the second, and the cubic terms in the third integration. Why do you think you could get (correct or at all) cubic terms in the first integration?
    – LutzL
    Nov 24 at 17:21










  • I mean it differently. When i consider, $ 2 cos t = sum_{k=0}^{infty} frac{(-1)^k t^{2k} }{(2k)!} $, then i get for k=1: $ 2- t^2 ne s_{11}=2$ Dont i have to get the indices synchronised?
    – Steven33
    Nov 24 at 17:34
















  • 2




    Writing $x(x)$ is confusing (even mildly infuriating), so please use $x(t)$ or something similar.
    – MisterRiemann
    Nov 24 at 15:26












  • I changed it. I am sorry.
    – Steven33
    Nov 24 at 16:53










  • You get the linear terms correct in the first integration, the quadratic terms in the second, and the cubic terms in the third integration. Why do you think you could get (correct or at all) cubic terms in the first integration?
    – LutzL
    Nov 24 at 17:21










  • I mean it differently. When i consider, $ 2 cos t = sum_{k=0}^{infty} frac{(-1)^k t^{2k} }{(2k)!} $, then i get for k=1: $ 2- t^2 ne s_{11}=2$ Dont i have to get the indices synchronised?
    – Steven33
    Nov 24 at 17:34










2




2




Writing $x(x)$ is confusing (even mildly infuriating), so please use $x(t)$ or something similar.
– MisterRiemann
Nov 24 at 15:26






Writing $x(x)$ is confusing (even mildly infuriating), so please use $x(t)$ or something similar.
– MisterRiemann
Nov 24 at 15:26














I changed it. I am sorry.
– Steven33
Nov 24 at 16:53




I changed it. I am sorry.
– Steven33
Nov 24 at 16:53












You get the linear terms correct in the first integration, the quadratic terms in the second, and the cubic terms in the third integration. Why do you think you could get (correct or at all) cubic terms in the first integration?
– LutzL
Nov 24 at 17:21




You get the linear terms correct in the first integration, the quadratic terms in the second, and the cubic terms in the third integration. Why do you think you could get (correct or at all) cubic terms in the first integration?
– LutzL
Nov 24 at 17:21












I mean it differently. When i consider, $ 2 cos t = sum_{k=0}^{infty} frac{(-1)^k t^{2k} }{(2k)!} $, then i get for k=1: $ 2- t^2 ne s_{11}=2$ Dont i have to get the indices synchronised?
– Steven33
Nov 24 at 17:34






I mean it differently. When i consider, $ 2 cos t = sum_{k=0}^{infty} frac{(-1)^k t^{2k} }{(2k)!} $, then i get for k=1: $ 2- t^2 ne s_{11}=2$ Dont i have to get the indices synchronised?
– Steven33
Nov 24 at 17:34












1 Answer
1






active

oldest

votes


















0














There is no guarantee that taking finitely many steps of Picard iteration will result in successively matched Taylor polynomials between the approximant and the solution. This does happen to occur for $y'=y,y(0)=1$ but this is in some sense a coincidence.






share|cite|improve this answer























  • In this case, my solutions work. Its easily to proof. But do you understand my index problem?
    – Steven33
    Nov 25 at 10:38













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%2f3011685%2fpicard-iteration-index%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









0














There is no guarantee that taking finitely many steps of Picard iteration will result in successively matched Taylor polynomials between the approximant and the solution. This does happen to occur for $y'=y,y(0)=1$ but this is in some sense a coincidence.






share|cite|improve this answer























  • In this case, my solutions work. Its easily to proof. But do you understand my index problem?
    – Steven33
    Nov 25 at 10:38


















0














There is no guarantee that taking finitely many steps of Picard iteration will result in successively matched Taylor polynomials between the approximant and the solution. This does happen to occur for $y'=y,y(0)=1$ but this is in some sense a coincidence.






share|cite|improve this answer























  • In this case, my solutions work. Its easily to proof. But do you understand my index problem?
    – Steven33
    Nov 25 at 10:38
















0












0








0






There is no guarantee that taking finitely many steps of Picard iteration will result in successively matched Taylor polynomials between the approximant and the solution. This does happen to occur for $y'=y,y(0)=1$ but this is in some sense a coincidence.






share|cite|improve this answer














There is no guarantee that taking finitely many steps of Picard iteration will result in successively matched Taylor polynomials between the approximant and the solution. This does happen to occur for $y'=y,y(0)=1$ but this is in some sense a coincidence.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 25 at 1:44

























answered Nov 25 at 1:18









Ian

67.3k25285




67.3k25285












  • In this case, my solutions work. Its easily to proof. But do you understand my index problem?
    – Steven33
    Nov 25 at 10:38




















  • In this case, my solutions work. Its easily to proof. But do you understand my index problem?
    – Steven33
    Nov 25 at 10:38


















In this case, my solutions work. Its easily to proof. But do you understand my index problem?
– Steven33
Nov 25 at 10:38






In this case, my solutions work. Its easily to proof. But do you understand my index problem?
– Steven33
Nov 25 at 10:38




















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.





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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3011685%2fpicard-iteration-index%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