How simplify final answer for series solution for $x''(t) + 2tx'(t) − 8x(t) = 0$?
up vote
1
down vote
favorite
We are given the IVP $x''(t) + 2tx'(t) − 8x(t) = 0$ subject to $x(0)=1$ and $x'(0)=0$.
I got:
$x(t)$ = $sum_{n=0}^∞=a_n.t^n$
$x'(t)= sum_{n=0}^∞=n.a_n.t^{n-1}$
$x''(t)= sum_{n=0}^∞=(n+1)(n+2).a_{n+2}.t^{n}$ using shift of sumbation.
Subbing in i got and simplifying i got:
$sum_{n=0}^∞=[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]t^n$.
And we want $[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]=0$
$a_{n+2} = (8-2n).a_n/(n+2)(n+1)$
We have $x(0)=1$ and $x'(0)=0$, so $a_o= 1$ and $a_1 = 0$, and we can get the rest of the solutions:
$a_2=4,a_3=0, a_4=4/3,a_5=0,a_6=0,a_7=0,a_8=0,a_9=0$
Have i attempted this correctly, and how do i get the final answers? Im not seeing the connection between the solutions..
sequences-and-series differential-equations
add a comment |
up vote
1
down vote
favorite
We are given the IVP $x''(t) + 2tx'(t) − 8x(t) = 0$ subject to $x(0)=1$ and $x'(0)=0$.
I got:
$x(t)$ = $sum_{n=0}^∞=a_n.t^n$
$x'(t)= sum_{n=0}^∞=n.a_n.t^{n-1}$
$x''(t)= sum_{n=0}^∞=(n+1)(n+2).a_{n+2}.t^{n}$ using shift of sumbation.
Subbing in i got and simplifying i got:
$sum_{n=0}^∞=[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]t^n$.
And we want $[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]=0$
$a_{n+2} = (8-2n).a_n/(n+2)(n+1)$
We have $x(0)=1$ and $x'(0)=0$, so $a_o= 1$ and $a_1 = 0$, and we can get the rest of the solutions:
$a_2=4,a_3=0, a_4=4/3,a_5=0,a_6=0,a_7=0,a_8=0,a_9=0$
Have i attempted this correctly, and how do i get the final answers? Im not seeing the connection between the solutions..
sequences-and-series differential-equations
2
You get $a_k=0$ for $k>4$, so the solution is a polynomial of degree 4, $x(t)=1+4x^2+frac43x^4$, as per your computed coefficients.
– LutzL
Nov 22 at 21:13
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
We are given the IVP $x''(t) + 2tx'(t) − 8x(t) = 0$ subject to $x(0)=1$ and $x'(0)=0$.
I got:
$x(t)$ = $sum_{n=0}^∞=a_n.t^n$
$x'(t)= sum_{n=0}^∞=n.a_n.t^{n-1}$
$x''(t)= sum_{n=0}^∞=(n+1)(n+2).a_{n+2}.t^{n}$ using shift of sumbation.
Subbing in i got and simplifying i got:
$sum_{n=0}^∞=[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]t^n$.
And we want $[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]=0$
$a_{n+2} = (8-2n).a_n/(n+2)(n+1)$
We have $x(0)=1$ and $x'(0)=0$, so $a_o= 1$ and $a_1 = 0$, and we can get the rest of the solutions:
$a_2=4,a_3=0, a_4=4/3,a_5=0,a_6=0,a_7=0,a_8=0,a_9=0$
Have i attempted this correctly, and how do i get the final answers? Im not seeing the connection between the solutions..
sequences-and-series differential-equations
We are given the IVP $x''(t) + 2tx'(t) − 8x(t) = 0$ subject to $x(0)=1$ and $x'(0)=0$.
I got:
$x(t)$ = $sum_{n=0}^∞=a_n.t^n$
$x'(t)= sum_{n=0}^∞=n.a_n.t^{n-1}$
$x''(t)= sum_{n=0}^∞=(n+1)(n+2).a_{n+2}.t^{n}$ using shift of sumbation.
Subbing in i got and simplifying i got:
$sum_{n=0}^∞=[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]t^n$.
And we want $[(n+2)(n+1)a_{n+2} +2n.a_n-8a_n]=0$
$a_{n+2} = (8-2n).a_n/(n+2)(n+1)$
We have $x(0)=1$ and $x'(0)=0$, so $a_o= 1$ and $a_1 = 0$, and we can get the rest of the solutions:
$a_2=4,a_3=0, a_4=4/3,a_5=0,a_6=0,a_7=0,a_8=0,a_9=0$
Have i attempted this correctly, and how do i get the final answers? Im not seeing the connection between the solutions..
sequences-and-series differential-equations
sequences-and-series differential-equations
edited Nov 22 at 20:09
asked Nov 22 at 19:57
Neels
227
227
2
You get $a_k=0$ for $k>4$, so the solution is a polynomial of degree 4, $x(t)=1+4x^2+frac43x^4$, as per your computed coefficients.
– LutzL
Nov 22 at 21:13
add a comment |
2
You get $a_k=0$ for $k>4$, so the solution is a polynomial of degree 4, $x(t)=1+4x^2+frac43x^4$, as per your computed coefficients.
– LutzL
Nov 22 at 21:13
2
2
You get $a_k=0$ for $k>4$, so the solution is a polynomial of degree 4, $x(t)=1+4x^2+frac43x^4$, as per your computed coefficients.
– LutzL
Nov 22 at 21:13
You get $a_k=0$ for $k>4$, so the solution is a polynomial of degree 4, $x(t)=1+4x^2+frac43x^4$, as per your computed coefficients.
– LutzL
Nov 22 at 21:13
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
The recurrence equation can actually be solved. The coefficient of $t^{2k+1}$ turns out to be $$ frac{3(-1)^k}{k!(2k-3)(4k^2-1)}$$
It turns out that the solution can be expressed in closed form:
$$ x(t) = frac{2t^3+5t}{8} e^{-t^2} + frac{sqrt{pi} text{erf}(t) (4 t^4 + 12 t^2 + 3)}{16}$$
although getting that from the series is not going to be easy.
EDIT:
Too bad you changed the initial conditions. Now the solution is as given by LutzL. The original was much more interesting, I think.
Thanks for the reply. How do you figure this out so quickly?
– Neels
Nov 22 at 20:12
Also please check my edits, because i initially typed out the wrong limits.
– Neels
Nov 22 at 20:13
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: "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',
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
});
}
});
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%2f3009575%2fhow-simplify-final-answer-for-series-solution-for-xt-2txt-%25e2%2588%2592-8xt-0%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
up vote
0
down vote
The recurrence equation can actually be solved. The coefficient of $t^{2k+1}$ turns out to be $$ frac{3(-1)^k}{k!(2k-3)(4k^2-1)}$$
It turns out that the solution can be expressed in closed form:
$$ x(t) = frac{2t^3+5t}{8} e^{-t^2} + frac{sqrt{pi} text{erf}(t) (4 t^4 + 12 t^2 + 3)}{16}$$
although getting that from the series is not going to be easy.
EDIT:
Too bad you changed the initial conditions. Now the solution is as given by LutzL. The original was much more interesting, I think.
Thanks for the reply. How do you figure this out so quickly?
– Neels
Nov 22 at 20:12
Also please check my edits, because i initially typed out the wrong limits.
– Neels
Nov 22 at 20:13
add a comment |
up vote
0
down vote
The recurrence equation can actually be solved. The coefficient of $t^{2k+1}$ turns out to be $$ frac{3(-1)^k}{k!(2k-3)(4k^2-1)}$$
It turns out that the solution can be expressed in closed form:
$$ x(t) = frac{2t^3+5t}{8} e^{-t^2} + frac{sqrt{pi} text{erf}(t) (4 t^4 + 12 t^2 + 3)}{16}$$
although getting that from the series is not going to be easy.
EDIT:
Too bad you changed the initial conditions. Now the solution is as given by LutzL. The original was much more interesting, I think.
Thanks for the reply. How do you figure this out so quickly?
– Neels
Nov 22 at 20:12
Also please check my edits, because i initially typed out the wrong limits.
– Neels
Nov 22 at 20:13
add a comment |
up vote
0
down vote
up vote
0
down vote
The recurrence equation can actually be solved. The coefficient of $t^{2k+1}$ turns out to be $$ frac{3(-1)^k}{k!(2k-3)(4k^2-1)}$$
It turns out that the solution can be expressed in closed form:
$$ x(t) = frac{2t^3+5t}{8} e^{-t^2} + frac{sqrt{pi} text{erf}(t) (4 t^4 + 12 t^2 + 3)}{16}$$
although getting that from the series is not going to be easy.
EDIT:
Too bad you changed the initial conditions. Now the solution is as given by LutzL. The original was much more interesting, I think.
The recurrence equation can actually be solved. The coefficient of $t^{2k+1}$ turns out to be $$ frac{3(-1)^k}{k!(2k-3)(4k^2-1)}$$
It turns out that the solution can be expressed in closed form:
$$ x(t) = frac{2t^3+5t}{8} e^{-t^2} + frac{sqrt{pi} text{erf}(t) (4 t^4 + 12 t^2 + 3)}{16}$$
although getting that from the series is not going to be easy.
EDIT:
Too bad you changed the initial conditions. Now the solution is as given by LutzL. The original was much more interesting, I think.
edited Nov 23 at 20:26
answered Nov 22 at 20:09
Robert Israel
317k23206457
317k23206457
Thanks for the reply. How do you figure this out so quickly?
– Neels
Nov 22 at 20:12
Also please check my edits, because i initially typed out the wrong limits.
– Neels
Nov 22 at 20:13
add a comment |
Thanks for the reply. How do you figure this out so quickly?
– Neels
Nov 22 at 20:12
Also please check my edits, because i initially typed out the wrong limits.
– Neels
Nov 22 at 20:13
Thanks for the reply. How do you figure this out so quickly?
– Neels
Nov 22 at 20:12
Thanks for the reply. How do you figure this out so quickly?
– Neels
Nov 22 at 20:12
Also please check my edits, because i initially typed out the wrong limits.
– Neels
Nov 22 at 20:13
Also please check my edits, because i initially typed out the wrong limits.
– Neels
Nov 22 at 20:13
add a comment |
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.
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%2f3009575%2fhow-simplify-final-answer-for-series-solution-for-xt-2txt-%25e2%2588%2592-8xt-0%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
2
You get $a_k=0$ for $k>4$, so the solution is a polynomial of degree 4, $x(t)=1+4x^2+frac43x^4$, as per your computed coefficients.
– LutzL
Nov 22 at 21:13