Applying the method of lines to a partial differential equation and using Runge-kutta method












0












$begingroup$


By method of lines I converted the PDE



u_t=u_{xx},
with the initial and boundary conditions



u(0,t)=u(0.1,t)
u(0,x)=sin(2*pi*x)


to a system of ODEs, as follows



function ut=pde1(t,u)
%
% Problem parameters
% global ncall
xl=0.0;
xr=1.0;
d=10;
a=10;
%
% PDE
n=length(u);
h=((xr-xl)/(n-1));
for i=1:n
if(i==1) ut(i)=0.0;
elseif(i==n) ut(i)=0;
else ut(i)=d*(u(i+1)-2.0*u(i)+u(i-1))/h^2;
end
end
ut=ut';
%


Now I am solving the ODEs ut by Runge-kutta method as follows:



%Initial condition
n=500;
for i=1:n
u0(i)=sin((2*pi)*(i-1)/(n-1));
end
t0=0.0;
tf=0.1;
tout=linspace(t0,tf,n);
y=zeros(n,length(tout));
y(:,1)=u0';
h=1/n;

for i = 1 : length(tout)
t=tout(i);
k1 = pde_1(t,y(:,i));
k2 = pde_1(t+h/2, y(:,i)+h*k1/2);
k3 = pde_1(t+h/2, y(:,i)+h*k2/2);
k4 = pde_1(t+h, y(:,i)+h*k3);
y(:,i+1) = y(:,i) + h*(k1 + 2*k2 + 2*k3 + k4)/6;

end

y
plot(tout,y(:,1))


but the outputs are NAN! any help?










share|cite|improve this question









$endgroup$












  • $begingroup$
    Welcome to the Mathematics StackExchange! What language are you programming in? Also, you might get a better answer from StackOverflow; while the Runge-kutta is a numerical algorithm, your focus appears to be on the implementation rather than the mathematical properties, its correctness, or proving theorems with the method.
    $endgroup$
    – Larry B.
    Jan 3 at 21:43






  • 1




    $begingroup$
    Your code deviates in some relevant points from your equations. Is it really u(0,t)=u(0.1,t) or did you want periodic boundaries u(0,t)=u(1,t) or zero boundaries u(0,t)=u(1,t)=0? The last one you enforced with your implementation. Do you get a useful result if you decrease the factor d or the time step h?
    $endgroup$
    – LutzL
    Jan 4 at 0:55


















0












$begingroup$


By method of lines I converted the PDE



u_t=u_{xx},
with the initial and boundary conditions



u(0,t)=u(0.1,t)
u(0,x)=sin(2*pi*x)


to a system of ODEs, as follows



function ut=pde1(t,u)
%
% Problem parameters
% global ncall
xl=0.0;
xr=1.0;
d=10;
a=10;
%
% PDE
n=length(u);
h=((xr-xl)/(n-1));
for i=1:n
if(i==1) ut(i)=0.0;
elseif(i==n) ut(i)=0;
else ut(i)=d*(u(i+1)-2.0*u(i)+u(i-1))/h^2;
end
end
ut=ut';
%


Now I am solving the ODEs ut by Runge-kutta method as follows:



%Initial condition
n=500;
for i=1:n
u0(i)=sin((2*pi)*(i-1)/(n-1));
end
t0=0.0;
tf=0.1;
tout=linspace(t0,tf,n);
y=zeros(n,length(tout));
y(:,1)=u0';
h=1/n;

for i = 1 : length(tout)
t=tout(i);
k1 = pde_1(t,y(:,i));
k2 = pde_1(t+h/2, y(:,i)+h*k1/2);
k3 = pde_1(t+h/2, y(:,i)+h*k2/2);
k4 = pde_1(t+h, y(:,i)+h*k3);
y(:,i+1) = y(:,i) + h*(k1 + 2*k2 + 2*k3 + k4)/6;

end

y
plot(tout,y(:,1))


but the outputs are NAN! any help?










share|cite|improve this question









$endgroup$












  • $begingroup$
    Welcome to the Mathematics StackExchange! What language are you programming in? Also, you might get a better answer from StackOverflow; while the Runge-kutta is a numerical algorithm, your focus appears to be on the implementation rather than the mathematical properties, its correctness, or proving theorems with the method.
    $endgroup$
    – Larry B.
    Jan 3 at 21:43






  • 1




    $begingroup$
    Your code deviates in some relevant points from your equations. Is it really u(0,t)=u(0.1,t) or did you want periodic boundaries u(0,t)=u(1,t) or zero boundaries u(0,t)=u(1,t)=0? The last one you enforced with your implementation. Do you get a useful result if you decrease the factor d or the time step h?
    $endgroup$
    – LutzL
    Jan 4 at 0:55
















0












0








0





$begingroup$


By method of lines I converted the PDE



u_t=u_{xx},
with the initial and boundary conditions



u(0,t)=u(0.1,t)
u(0,x)=sin(2*pi*x)


to a system of ODEs, as follows



function ut=pde1(t,u)
%
% Problem parameters
% global ncall
xl=0.0;
xr=1.0;
d=10;
a=10;
%
% PDE
n=length(u);
h=((xr-xl)/(n-1));
for i=1:n
if(i==1) ut(i)=0.0;
elseif(i==n) ut(i)=0;
else ut(i)=d*(u(i+1)-2.0*u(i)+u(i-1))/h^2;
end
end
ut=ut';
%


Now I am solving the ODEs ut by Runge-kutta method as follows:



%Initial condition
n=500;
for i=1:n
u0(i)=sin((2*pi)*(i-1)/(n-1));
end
t0=0.0;
tf=0.1;
tout=linspace(t0,tf,n);
y=zeros(n,length(tout));
y(:,1)=u0';
h=1/n;

for i = 1 : length(tout)
t=tout(i);
k1 = pde_1(t,y(:,i));
k2 = pde_1(t+h/2, y(:,i)+h*k1/2);
k3 = pde_1(t+h/2, y(:,i)+h*k2/2);
k4 = pde_1(t+h, y(:,i)+h*k3);
y(:,i+1) = y(:,i) + h*(k1 + 2*k2 + 2*k3 + k4)/6;

end

y
plot(tout,y(:,1))


but the outputs are NAN! any help?










share|cite|improve this question









$endgroup$




By method of lines I converted the PDE



u_t=u_{xx},
with the initial and boundary conditions



u(0,t)=u(0.1,t)
u(0,x)=sin(2*pi*x)


to a system of ODEs, as follows



function ut=pde1(t,u)
%
% Problem parameters
% global ncall
xl=0.0;
xr=1.0;
d=10;
a=10;
%
% PDE
n=length(u);
h=((xr-xl)/(n-1));
for i=1:n
if(i==1) ut(i)=0.0;
elseif(i==n) ut(i)=0;
else ut(i)=d*(u(i+1)-2.0*u(i)+u(i-1))/h^2;
end
end
ut=ut';
%


Now I am solving the ODEs ut by Runge-kutta method as follows:



%Initial condition
n=500;
for i=1:n
u0(i)=sin((2*pi)*(i-1)/(n-1));
end
t0=0.0;
tf=0.1;
tout=linspace(t0,tf,n);
y=zeros(n,length(tout));
y(:,1)=u0';
h=1/n;

for i = 1 : length(tout)
t=tout(i);
k1 = pde_1(t,y(:,i));
k2 = pde_1(t+h/2, y(:,i)+h*k1/2);
k3 = pde_1(t+h/2, y(:,i)+h*k2/2);
k4 = pde_1(t+h, y(:,i)+h*k3);
y(:,i+1) = y(:,i) + h*(k1 + 2*k2 + 2*k3 + k4)/6;

end

y
plot(tout,y(:,1))


but the outputs are NAN! any help?







numerical-methods heat-equation runge-kutta-methods






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 3 at 21:17









Ahmad M.o KassefAhmad M.o Kassef

1




1












  • $begingroup$
    Welcome to the Mathematics StackExchange! What language are you programming in? Also, you might get a better answer from StackOverflow; while the Runge-kutta is a numerical algorithm, your focus appears to be on the implementation rather than the mathematical properties, its correctness, or proving theorems with the method.
    $endgroup$
    – Larry B.
    Jan 3 at 21:43






  • 1




    $begingroup$
    Your code deviates in some relevant points from your equations. Is it really u(0,t)=u(0.1,t) or did you want periodic boundaries u(0,t)=u(1,t) or zero boundaries u(0,t)=u(1,t)=0? The last one you enforced with your implementation. Do you get a useful result if you decrease the factor d or the time step h?
    $endgroup$
    – LutzL
    Jan 4 at 0:55




















  • $begingroup$
    Welcome to the Mathematics StackExchange! What language are you programming in? Also, you might get a better answer from StackOverflow; while the Runge-kutta is a numerical algorithm, your focus appears to be on the implementation rather than the mathematical properties, its correctness, or proving theorems with the method.
    $endgroup$
    – Larry B.
    Jan 3 at 21:43






  • 1




    $begingroup$
    Your code deviates in some relevant points from your equations. Is it really u(0,t)=u(0.1,t) or did you want periodic boundaries u(0,t)=u(1,t) or zero boundaries u(0,t)=u(1,t)=0? The last one you enforced with your implementation. Do you get a useful result if you decrease the factor d or the time step h?
    $endgroup$
    – LutzL
    Jan 4 at 0:55


















$begingroup$
Welcome to the Mathematics StackExchange! What language are you programming in? Also, you might get a better answer from StackOverflow; while the Runge-kutta is a numerical algorithm, your focus appears to be on the implementation rather than the mathematical properties, its correctness, or proving theorems with the method.
$endgroup$
– Larry B.
Jan 3 at 21:43




$begingroup$
Welcome to the Mathematics StackExchange! What language are you programming in? Also, you might get a better answer from StackOverflow; while the Runge-kutta is a numerical algorithm, your focus appears to be on the implementation rather than the mathematical properties, its correctness, or proving theorems with the method.
$endgroup$
– Larry B.
Jan 3 at 21:43




1




1




$begingroup$
Your code deviates in some relevant points from your equations. Is it really u(0,t)=u(0.1,t) or did you want periodic boundaries u(0,t)=u(1,t) or zero boundaries u(0,t)=u(1,t)=0? The last one you enforced with your implementation. Do you get a useful result if you decrease the factor d or the time step h?
$endgroup$
– LutzL
Jan 4 at 0:55






$begingroup$
Your code deviates in some relevant points from your equations. Is it really u(0,t)=u(0.1,t) or did you want periodic boundaries u(0,t)=u(1,t) or zero boundaries u(0,t)=u(1,t)=0? The last one you enforced with your implementation. Do you get a useful result if you decrease the factor d or the time step h?
$endgroup$
– LutzL
Jan 4 at 0:55












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%2f3061012%2fapplying-the-method-of-lines-to-a-partial-differential-equation-and-using-runge%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%2f3061012%2fapplying-the-method-of-lines-to-a-partial-differential-equation-and-using-runge%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

Bressuire

Cabo Verde

Gyllenstierna