Feeds
답변 있음
Euler Method IVP Coding Help
w0=0.5; a=0; b=2; hh=[0.5 0.2 0.1 0.05 0.01 0.005 0.001]; f=@(t,y) y-t^2+1; for j=1:7 we(1,j)=w0; wm(1,j)=w0; wr(1,j)=w0...
Euler Method IVP Coding Help
w0=0.5; a=0; b=2; hh=[0.5 0.2 0.1 0.05 0.01 0.005 0.001]; f=@(t,y) y-t^2+1; for j=1:7 we(1,j)=w0; wm(1,j)=w0; wr(1,j)=w0...
2년 초과 전 | 0
답변 있음
Derivative
clc; syms x f = @(x) sin(x); x = pi/2; h = 0.0001; d = (f(x+h)-f(x-h)/2*h)
Derivative
clc; syms x f = @(x) sin(x); x = pi/2; h = 0.0001; d = (f(x+h)-f(x-h)/2*h)
2년 초과 전 | 0
답변 있음
Sum of Least Squares
xi = [1491214 17]; yi = [-3.97, 5.18, 20.43, 29.58, 35.68, 44.83]; n = length(xi); A = [n sum(xi); sum(xi) sum(xi.^2)]; C = ...
Sum of Least Squares
xi = [1491214 17]; yi = [-3.97, 5.18, 20.43, 29.58, 35.68, 44.83]; n = length(xi); A = [n sum(xi); sum(xi) sum(xi.^2)]; C = ...
2년 초과 전 | 0
답변 있음
lagrange interpolation, .m
function Y = Lagrange_371(x,y,X) n = length(x) - 1; Y = 0; for i = 0:n prod = 1; for j = 0:n if i ~= j ...
lagrange interpolation, .m
function Y = Lagrange_371(x,y,X) n = length(x) - 1; Y = 0; for i = 0:n prod = 1; for j = 0:n if i ~= j ...
2년 초과 전 | 0
답변 있음
Help with newton-raphson
function [p, PN] = Newton_371(p0,N,tol,f,fp) p=p0; PN(1)=p0; for n= 1:N p=p-f(p)/fp(p); PN(n+1) =p; if abs(p-P...
Help with newton-raphson
function [p, PN] = Newton_371(p0,N,tol,f,fp) p=p0; PN(1)=p0; for n= 1:N p=p-f(p)/fp(p); PN(n+1) =p; if abs(p-P...
2년 초과 전 | 0
답변 있음
Bisection method relative error
function [p, pN] = Bisection_371(a,b,N, tol) if f(a)*f(b) > 0 disp("IVT does not guarantee a root in [a,b]") elseif f(a)*f...
Bisection method relative error
function [p, pN] = Bisection_371(a,b,N, tol) if f(a)*f(b) > 0 disp("IVT does not guarantee a root in [a,b]") elseif f(a)*f...
2년 초과 전 | 0
