global and unique solution for ODE
Let $y' = f(x) p(cos y) + g(x) q( sin y) $ and $y(0) =1$, with $f,g$ continuous and $p,q$ polynomials. Then there exists unique solution on all $mathbb{R}$ ?
Its easily solved if i assumed that $f,g$ are bounded, but the question asks about $f,g$ that are not necessarily bounded.
Can any one give a hint or a solution !
differential-equations
add a comment |
Let $y' = f(x) p(cos y) + g(x) q( sin y) $ and $y(0) =1$, with $f,g$ continuous and $p,q$ polynomials. Then there exists unique solution on all $mathbb{R}$ ?
Its easily solved if i assumed that $f,g$ are bounded, but the question asks about $f,g$ that are not necessarily bounded.
Can any one give a hint or a solution !
differential-equations
add a comment |
Let $y' = f(x) p(cos y) + g(x) q( sin y) $ and $y(0) =1$, with $f,g$ continuous and $p,q$ polynomials. Then there exists unique solution on all $mathbb{R}$ ?
Its easily solved if i assumed that $f,g$ are bounded, but the question asks about $f,g$ that are not necessarily bounded.
Can any one give a hint or a solution !
differential-equations
Let $y' = f(x) p(cos y) + g(x) q( sin y) $ and $y(0) =1$, with $f,g$ continuous and $p,q$ polynomials. Then there exists unique solution on all $mathbb{R}$ ?
Its easily solved if i assumed that $f,g$ are bounded, but the question asks about $f,g$ that are not necessarily bounded.
Can any one give a hint or a solution !
differential-equations
differential-equations
edited Nov 26 at 10:29
LutzL
55.8k42054
55.8k42054
asked Nov 26 at 9:39
Ahmad
2,5241625
2,5241625
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$f$ and $g$ are bounded on every interval $[-R,R]$ for any $R=NinBbb N$. Thus you get unique solutions over these intervals, and by the uniqueness the solution for $R=N+1$ extends the solution for $R=N$. In the limit this gives a unique solution over all of $Bbb R$.
Can you tell please, what theorem are you referring to?
– Evgeny
Nov 26 at 11:06
What do you mean, that a global Lipschitz constant on $(t,y)in [a,b]times Bbb R^n$ ensures the existence of a solution over $[a,b]$? This is a variant of the Picard-Lindelöf theorem.
– LutzL
Nov 26 at 11:21
If you remember the reference with a proof for this variant and can tell me, I would be very grateful!
– Evgeny
Nov 26 at 11:37
See math.stackexchange.com/a/2987844/115115 and linked posts. I know this variant from my lectures, I do not know which books one could cite. There is also a variant of this global proof that uses the Lipschitz constants of the iterates of the Picard iteration, which fall faster than simply the power of the Lipschitz constant of one iteration.
– LutzL
Nov 26 at 11:47
Thank you very much!
– Evgeny
Nov 26 at 12:01
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',
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
});
}
});
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%2f3014106%2fglobal-and-unique-solution-for-ode%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
$f$ and $g$ are bounded on every interval $[-R,R]$ for any $R=NinBbb N$. Thus you get unique solutions over these intervals, and by the uniqueness the solution for $R=N+1$ extends the solution for $R=N$. In the limit this gives a unique solution over all of $Bbb R$.
Can you tell please, what theorem are you referring to?
– Evgeny
Nov 26 at 11:06
What do you mean, that a global Lipschitz constant on $(t,y)in [a,b]times Bbb R^n$ ensures the existence of a solution over $[a,b]$? This is a variant of the Picard-Lindelöf theorem.
– LutzL
Nov 26 at 11:21
If you remember the reference with a proof for this variant and can tell me, I would be very grateful!
– Evgeny
Nov 26 at 11:37
See math.stackexchange.com/a/2987844/115115 and linked posts. I know this variant from my lectures, I do not know which books one could cite. There is also a variant of this global proof that uses the Lipschitz constants of the iterates of the Picard iteration, which fall faster than simply the power of the Lipschitz constant of one iteration.
– LutzL
Nov 26 at 11:47
Thank you very much!
– Evgeny
Nov 26 at 12:01
add a comment |
$f$ and $g$ are bounded on every interval $[-R,R]$ for any $R=NinBbb N$. Thus you get unique solutions over these intervals, and by the uniqueness the solution for $R=N+1$ extends the solution for $R=N$. In the limit this gives a unique solution over all of $Bbb R$.
Can you tell please, what theorem are you referring to?
– Evgeny
Nov 26 at 11:06
What do you mean, that a global Lipschitz constant on $(t,y)in [a,b]times Bbb R^n$ ensures the existence of a solution over $[a,b]$? This is a variant of the Picard-Lindelöf theorem.
– LutzL
Nov 26 at 11:21
If you remember the reference with a proof for this variant and can tell me, I would be very grateful!
– Evgeny
Nov 26 at 11:37
See math.stackexchange.com/a/2987844/115115 and linked posts. I know this variant from my lectures, I do not know which books one could cite. There is also a variant of this global proof that uses the Lipschitz constants of the iterates of the Picard iteration, which fall faster than simply the power of the Lipschitz constant of one iteration.
– LutzL
Nov 26 at 11:47
Thank you very much!
– Evgeny
Nov 26 at 12:01
add a comment |
$f$ and $g$ are bounded on every interval $[-R,R]$ for any $R=NinBbb N$. Thus you get unique solutions over these intervals, and by the uniqueness the solution for $R=N+1$ extends the solution for $R=N$. In the limit this gives a unique solution over all of $Bbb R$.
$f$ and $g$ are bounded on every interval $[-R,R]$ for any $R=NinBbb N$. Thus you get unique solutions over these intervals, and by the uniqueness the solution for $R=N+1$ extends the solution for $R=N$. In the limit this gives a unique solution over all of $Bbb R$.
answered Nov 26 at 10:31
LutzL
55.8k42054
55.8k42054
Can you tell please, what theorem are you referring to?
– Evgeny
Nov 26 at 11:06
What do you mean, that a global Lipschitz constant on $(t,y)in [a,b]times Bbb R^n$ ensures the existence of a solution over $[a,b]$? This is a variant of the Picard-Lindelöf theorem.
– LutzL
Nov 26 at 11:21
If you remember the reference with a proof for this variant and can tell me, I would be very grateful!
– Evgeny
Nov 26 at 11:37
See math.stackexchange.com/a/2987844/115115 and linked posts. I know this variant from my lectures, I do not know which books one could cite. There is also a variant of this global proof that uses the Lipschitz constants of the iterates of the Picard iteration, which fall faster than simply the power of the Lipschitz constant of one iteration.
– LutzL
Nov 26 at 11:47
Thank you very much!
– Evgeny
Nov 26 at 12:01
add a comment |
Can you tell please, what theorem are you referring to?
– Evgeny
Nov 26 at 11:06
What do you mean, that a global Lipschitz constant on $(t,y)in [a,b]times Bbb R^n$ ensures the existence of a solution over $[a,b]$? This is a variant of the Picard-Lindelöf theorem.
– LutzL
Nov 26 at 11:21
If you remember the reference with a proof for this variant and can tell me, I would be very grateful!
– Evgeny
Nov 26 at 11:37
See math.stackexchange.com/a/2987844/115115 and linked posts. I know this variant from my lectures, I do not know which books one could cite. There is also a variant of this global proof that uses the Lipschitz constants of the iterates of the Picard iteration, which fall faster than simply the power of the Lipschitz constant of one iteration.
– LutzL
Nov 26 at 11:47
Thank you very much!
– Evgeny
Nov 26 at 12:01
Can you tell please, what theorem are you referring to?
– Evgeny
Nov 26 at 11:06
Can you tell please, what theorem are you referring to?
– Evgeny
Nov 26 at 11:06
What do you mean, that a global Lipschitz constant on $(t,y)in [a,b]times Bbb R^n$ ensures the existence of a solution over $[a,b]$? This is a variant of the Picard-Lindelöf theorem.
– LutzL
Nov 26 at 11:21
What do you mean, that a global Lipschitz constant on $(t,y)in [a,b]times Bbb R^n$ ensures the existence of a solution over $[a,b]$? This is a variant of the Picard-Lindelöf theorem.
– LutzL
Nov 26 at 11:21
If you remember the reference with a proof for this variant and can tell me, I would be very grateful!
– Evgeny
Nov 26 at 11:37
If you remember the reference with a proof for this variant and can tell me, I would be very grateful!
– Evgeny
Nov 26 at 11:37
See math.stackexchange.com/a/2987844/115115 and linked posts. I know this variant from my lectures, I do not know which books one could cite. There is also a variant of this global proof that uses the Lipschitz constants of the iterates of the Picard iteration, which fall faster than simply the power of the Lipschitz constant of one iteration.
– LutzL
Nov 26 at 11:47
See math.stackexchange.com/a/2987844/115115 and linked posts. I know this variant from my lectures, I do not know which books one could cite. There is also a variant of this global proof that uses the Lipschitz constants of the iterates of the Picard iteration, which fall faster than simply the power of the Lipschitz constant of one iteration.
– LutzL
Nov 26 at 11:47
Thank you very much!
– Evgeny
Nov 26 at 12:01
Thank you very much!
– Evgeny
Nov 26 at 12:01
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%2f3014106%2fglobal-and-unique-solution-for-ode%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