Iniciar

Pausar

Reiniciar

F(L)

L

x

V(x)

L_1

L_2

L_3

L_4

Máquina de Brayton Quântica

a_1 = 1

a_1 = 0

a_2 = 1

a_2 = 0

Níveis de ocupação

Simulação da Máquina de Brayton Quântica

Expansão isobárica quântica

F(L) = C

Expansão adiabática quântica

F(L) L^3 = C

Compressão isobárica quântica

F(L)  = C

Compressão adiabática quântica

F(L) L^3 = C

Eficiência

\eta =  1 - \left (\frac{F(L_3)}{F(L_1)} \right )^\left ( 1 - \frac{1}{3} \right )

F_1 = F_1''''

F(L_1) = F_1

F(L_3) = F_2''

Q_{A \to B}

Q_{C \to D}

U_1 = (-3, -1)
S_1 = (-4, -1)
a_1 = Segment(S_1, U_1)
R_1 = (0.34, 1.02)
T = (-0.98, 2.26)
S = (-1, -2)
R = (-12, -2)
Q = (-12.02, 2.28)
pol1, q, r, s, t_1 = Polygon(Q, R, S, T)
P_1 = Point(r)
O_1 = Point(t_1)
l_1 = Segment(O_1, P_1)
Q_1 = Point(l_1)
p_1 = Segment(Q_1, R_1)
V_1 = Point(p_1)
b_1 = Segment(U_1, V_1)
O_3 = Intersect(a_1, b_1)
w = 1.85 (slider from -5 to 5, step 0.05)
L_1 = 0.35 (slider from -5 to 5, step 0.05)
p1(x) = If[0 ≤ x ≤ 10, w / ((3 * L_1^(2)))]
A = Point(p1)
a2(x) = If[0 ≤ x ≤ 10, (y(A) * (x(A) / x)^(3))]
B = Point(p1)
a1(x) = If[0 ≤ x ≤ 10, (y(B) * (x(B) / x)^(3))]
L_3 = 0.95 (slider from -5 to 5, step 0.05)
p2(x) = If[0 ≤ x ≤ 10, (4 * w / ((5 * L_3^(2))))]
D = Intersect(p2, a2, (3.836812299252818, 1.6398891966759004))
C = Intersect(p2, a1, (6.946955602434951, 1.6398891966759004))
t:0
k = If(0 ≤ t  <  1, ((x(B) - x(A)) * t) + x(A), If[1 ≤ t  <  2, ((x(C) - x(B)) * (t - 1)) + x(B), If[2 ≤ t  <  3, x(C) - ((x(C) - x(D)) * (t - 2)), If[3 ≤ t ≤ 4, x(D) - ((x(D) - x(A)) * (t - 3))]]])
a = CurveCartesian(t, p1(t), t, x(A), x(B))
b = CurveCartesian(t, a1(t), t, x(B), x(C))
d = CurveCartesian(t, a2(t), t, x(A), x(D))
E = (1, 0)
F = (7.78, 0)
G = (1.02, 6.22)
I = (1.0000000000000089, 0)
J = (8.780000000000008, -0.02)
u = Vector(I, J)
K = Point(u)
L = (1, 7.36)
v = Vector(K, L)
M = (-10, 7)
N = (-10, 3)
e = Segment(M, N)
O: (-10 + (k * 0.7), 3)
f = Segment(N, O)
P: (-10 + (k * 0.7), 7)
g = Segment(O, P)
H: (k, If[0 ≤ t  <  1, p1(k), If[1 ≤ t  <  2, a1(k), If[2 ≤ t  <  3, p2(k), If[3 ≤ t ≤ 4, a2(k)]]]])
U = (-9.98, 8.4)
h = Vector(N, U)
V = (-3, 3)
i = Vector(N, V)
W = Point(u)
j = Segment(A, W)
Z = Point(u)
l = Segment(B, Z)
A_1 = Point(u)
m = Segment(C, A_1)
B_1 = Point(u)
n = Segment(D, B_1)
C_1: (x(N), 7 - (k * 0.4))
D_1: (x(O), 7 - (k * 0.4))
F_3: (-4, 3.1 - (k * 0.8))
G_1 = (-4, -1)
H_1 = (-3, -1)
I_1: (-3, 3.1 - (k * 0.8))
M_1 = (-1.34, -0.98)
N_1 = (-2.28, -0.98)
d_1 = Segment(N_1, M_1)
T_1 = Point(p_1)
p = Segment(S_1, T_1)
Z_1 = Point(p_1)
c_1 = Segment(N_1, Z_1)
D_2 = Point(p_1)
e_1 = Segment(M_1, D_2)
pol4, t_2, v_1, u_2, s_2 = Polygon(T_1, V_1, U_1, S_1)
pol6, z_1, d_2, m_2, n_2 = Polygon(Z_1, D_2, M_1, N_1)
E_2: (-2.3, -3 + (k * 0.6))
F_5: (-1.35, -3 + (k * 0.6))
pol7, n_3, e_2, f_2, m_3 = Polygon(N_1, E_2, F_5, M_1)
G_2 = Intersect(q, r)
pol8, q_1, g_2, s_3, t_3 = Polygon(Q, G_2, S, T)
A_2: (x(C_1), 6.95 - (k * 0.4))
H_2: (x(D_1), 6.95 - (k * 0.4))
I_2: (x(C_1), 6.08 - (k * 0.4))
J_2: (x(D_1), 6.08 - (k * 0.4))
F_2'' = Segment(C_1, D_1)
E_3 = Point(e)
O_2 = Point(g)
F_1 = Segment(E_3, O_2)
W_1: (x(N), 6.85 - (k * 0.7))
K_2: (x(O), 6.85 - (k * 0.7))
F_1'''' = Segment(W_1, K_2)
N_2 = (9.9, 7.2)
L_2 = Point(e)
M_2 = Point(g)
F_6 = Segment(L_2, M_2)
P_2: (x(N), 2.2 + (k * 0.6))
Q_2: (x(O), 2.2 + (k * 0.6))
R_2: (x(N), 5.8 - (k * 0.4))
S_2: (x(O), 5.8 - (k * 0.4))
T_2 = (9.52, 5.46)
J_1 = Intersect(d_1, c_1)
K_1 = Intersect(d_1, e_1)
U_2: (-1.34, -3 + (0.8 * k))
V_2: (-2.3, -3 + (0.8 * k))
pol3, j_1, k_1, u_3, v_2 = Polygon(J_1, K_1, U_2, V_2)
W_2: (-3, 3.5 - (k * 0.7))
Z_2: (-4, 3.5 - (k * 0.7))
c = CurveCartesian(t, p2(t), t, x(D), x(C))
E_1 = Intersect(p, a_1)
B_2 = Intersect(a_1, b_1)
pol2, e_3, f_3, i_1, b_2 = Polygon(E_1, F_3, I_1, B_2)
A_3: (x(C_1), 7 - (0.4 * k))
B_3: (x(D_1), 7 - (0.4 * k))
F_2' = Segment(A_3, B_3)
C_3: (x(C_1), 3.2 + (0.4 * k))
D_3: (x(D_1), 3.2 + (0.4 * k))
F_1' = Segment(C_3, D_3)
G_3: (x(C_1), 2.8 + (0.4 * k))
H_3: (x(D_1), 2.8 + (0.4 * k))
F_2''' = Segment(G_3, H_3)
I_3: (x(C_1), 6 - (0.4 * k))
J_3: (x(D_1), 6 - (0.4 * k))
F_1''' = Segment(I_3, J_3)
K_3 = Intersect(p, a_1)
M_3: (x(K_3), 3.5 - (0.6 * k))
N_3: (x(O_3), 3.5 - (k * 0.6))
pol5, k_3, m_1, n_1, o_3 = Polygon(K_3, M_3, N_3, O_3)
P_3 = (9.26, 7.5)
C_2 = (3.78, 6.2)
F_2 = (3.8, 5.28)
u_1 = Vector(C_2, F_2)
Q_3 = (5.12, 1.44)
R_3 = (5.12, 0.5)
w_1 = Vector(Q_3, R_3)