How can i converge my leapfrog code












-1












$begingroup$


in leapfrog method i should compute this discretization equation



$$frac{u_i^{n+1}-u_i^{n-1}}{2∆t}=-cfrac{u_{i+1}^n-u_{i-1}^n}{2∆x}$$
my major problem is that how can I compute the $u_i^{n-1}$ term ???



thanks a lot










share|cite|improve this question











$endgroup$












  • $begingroup$
    This question is nearly impossible to read in its current state, and appears to be a duplicate of another that you posted just recently. StackExchange supports editing of questions, so you can modify your question to fix formatting or add clarification. You don't need to ask a whole new copy of a question each time you want to change something. :) Also, a bit more context and explanation wouldn't go amiss here.
    $endgroup$
    – Ricky Tensor
    Jan 10 at 6:38


















-1












$begingroup$


in leapfrog method i should compute this discretization equation



$$frac{u_i^{n+1}-u_i^{n-1}}{2∆t}=-cfrac{u_{i+1}^n-u_{i-1}^n}{2∆x}$$
my major problem is that how can I compute the $u_i^{n-1}$ term ???



thanks a lot










share|cite|improve this question











$endgroup$












  • $begingroup$
    This question is nearly impossible to read in its current state, and appears to be a duplicate of another that you posted just recently. StackExchange supports editing of questions, so you can modify your question to fix formatting or add clarification. You don't need to ask a whole new copy of a question each time you want to change something. :) Also, a bit more context and explanation wouldn't go amiss here.
    $endgroup$
    – Ricky Tensor
    Jan 10 at 6:38
















-1












-1








-1





$begingroup$


in leapfrog method i should compute this discretization equation



$$frac{u_i^{n+1}-u_i^{n-1}}{2∆t}=-cfrac{u_{i+1}^n-u_{i-1}^n}{2∆x}$$
my major problem is that how can I compute the $u_i^{n-1}$ term ???



thanks a lot










share|cite|improve this question











$endgroup$




in leapfrog method i should compute this discretization equation



$$frac{u_i^{n+1}-u_i^{n-1}}{2∆t}=-cfrac{u_{i+1}^n-u_{i-1}^n}{2∆x}$$
my major problem is that how can I compute the $u_i^{n-1}$ term ???



thanks a lot







pde finite-difference-methods






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 10 at 7:47







Amin Dpp

















asked Jan 10 at 6:21









Amin DppAmin Dpp

12




12












  • $begingroup$
    This question is nearly impossible to read in its current state, and appears to be a duplicate of another that you posted just recently. StackExchange supports editing of questions, so you can modify your question to fix formatting or add clarification. You don't need to ask a whole new copy of a question each time you want to change something. :) Also, a bit more context and explanation wouldn't go amiss here.
    $endgroup$
    – Ricky Tensor
    Jan 10 at 6:38




















  • $begingroup$
    This question is nearly impossible to read in its current state, and appears to be a duplicate of another that you posted just recently. StackExchange supports editing of questions, so you can modify your question to fix formatting or add clarification. You don't need to ask a whole new copy of a question each time you want to change something. :) Also, a bit more context and explanation wouldn't go amiss here.
    $endgroup$
    – Ricky Tensor
    Jan 10 at 6:38


















$begingroup$
This question is nearly impossible to read in its current state, and appears to be a duplicate of another that you posted just recently. StackExchange supports editing of questions, so you can modify your question to fix formatting or add clarification. You don't need to ask a whole new copy of a question each time you want to change something. :) Also, a bit more context and explanation wouldn't go amiss here.
$endgroup$
– Ricky Tensor
Jan 10 at 6:38






$begingroup$
This question is nearly impossible to read in its current state, and appears to be a duplicate of another that you posted just recently. StackExchange supports editing of questions, so you can modify your question to fix formatting or add clarification. You don't need to ask a whole new copy of a question each time you want to change something. :) Also, a bit more context and explanation wouldn't go amiss here.
$endgroup$
– Ricky Tensor
Jan 10 at 6:38












0






active

oldest

votes











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%2f3068306%2fhow-can-i-converge-my-leapfrog-code%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3068306%2fhow-can-i-converge-my-leapfrog-code%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

Mario Kart Wii

What does “Dominus providebit” mean?

Antonio Litta Visconti Arese