%Program Metode Newton Raphson

p0 = 10; %nilai titik awal

delta = 1e-5; %ketelitian
Niter= 50; %jumlah iterasi

for i =1:Niter
p1 = p0 - feval('fungsiku',p0)./feval('def_fungsiku',p0)
err = abs(p1-p0)
p0 = p1
yc = feval('fungsiku',p0)
if err<delta;
break
end
fprintf('nilai akar = %5.5f nilai yc = %2.5f \n',p0,yc)
end

disp ('akarnya')
disp (p0) %nilai akar
disp ('yc')
disp (yc)

f = sqrt(9.8*m./0.25).*tanh(sqrt(9.8*0.25./m).*4)-36;
df = (0.5)*(sqrt(9.8./(m*0.25)).*tanh(sqrt(9.8*0.25./m)*4))-(9.8./
(2*m))*4.*sech(sqrt(9.8.*0.25./m)*4).^2;

x = [-1:0.01:1];
y = x.^4+3.*x.^3+7.*x.^2;
dy = 4.*x.^3+9.*x.^2+14.*x;
ddy = 12.*x.^2+18.*x+14;
plot(x,y,'-r',x,dy,':b',x,ddy,'-g')

clc
clear
disp(�Pada rangkaian listrik berikut ini tentukanlah daya yang melalui R3.�);
disp(�Diketahui e1=8v, e2=8v, e3=2v.�);
disp(�Harga masing-masing hambatan adalah R1= 5 ohm, R2= 1 ohm, R3= 2ohm, R4=1 ohm,
R5= 5 ohm.�);
R1=5;
R2=1;
R3=2;
R4=1;
R5=5;
V1=input(�v1= �);
V2=input(�v2= �);
V3=input(�v3= �);
disp([�R1=�, num2str(R1),�ohm�]);
disp([�R2=�, num2str(R2),�ohm�]);
disp([�R3=�, num2str(R3),�ohm�]);
disp([�R4=�, num2str(R4),�ohm�]);
disp([�R5=�, num2str(R5),�ohm�]);
disp([�V1=�, num2str(V1),�Volt�]);
disp([�V2=�, num2str(V2),�Volt�]);
disp([�V3=�, num2str(V3),�Volt�]);
A=[8 2; 2 8];
K=inv(A);
B=[V1-V3;V2-V3];
X=K*B;
i1=X(1,1);
i2=X(2,1);
i3=i1+i2;
P1=i1^2*R1;
P2=i2^2*R2;
P3=i3^2*R3;
disp(�TEKAN UNTUK MELANJUTKAN�);
pause
clc
disp(�DI PROGRAM INI ANDA DAPAT MENCARI�);
disp(�1. Arus tiap titik�);
disp(�2. Daya tiap hambatan�);
pilihan=input(�PILIH PILIHAN ANDA= �);
switch pilihan
case(1)
disp(�MENCARI ARUS�);
disp([�Arus I1=�,num2str(P1),�Ampere�]);
disp([�Arus I2=�,num2str(P1),�Ampere�]);
disp([�Arus I3=�,num2str(P1),�Ampere�]);
case(2)
disp(�MENCARI DAYA�);
disp([�Daya di R1=�,num2str(P1),�Watt�]);
disp([�Daya di R2=�,num2str(P1),�Watt�]);
disp([�Daya di R3=�,num2str(P1),�Watt�]);
end

% Program GaussNaive
function x = GaussNaive(A,b)
% GaussNaive: naive Gauss elimination
% x = GaussNaive(A,b): Gauss elimination without pivoting.
% input:
% A = coefficient matrix
% b = right hand side vector
% output:
% x = solution vector
[m,n] = size(A);
if m~=n, error('Matrix A must be square'); end
nb = n+1;
Aug = [A b];
% forward elimination
for k = 1:n-1
for i = k+1:n
factor = Aug(i,k)/Aug(k,k);
Aug(i,k:nb) = Aug(i,k:nb)-factor*Aug(k,k:nb);
end
end
% back substitution
x = zeros(n,1);
x(n) = Aug(n,nb)/Aug(n,n);
for i = n-1:-1:1
x(i) = (Aug(i,nb)-Aug(i,i+1:n)*x(i+1:n))/Aug(i,i);
end