Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Renaming Changes #36

Merged
merged 5 commits into from
May 31, 2024
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions examples/construct_multi_dimensional_function.jl
Original file line number Diff line number Diff line change
Expand Up @@ -14,9 +14,9 @@ s = continuous_siteinds(g; map_dimension=3)
println(
"Constructing the 3D function f(x,y,z) = x³(y + y²) + cosh(πz) as a tensor network on a randomly chosen tree with $L vertices",
)
ψ_fx = poly_itn(s, [0.0, 0.0, 0.0, 1.0]; dimension=1)
ψ_fy = poly_itn(s, [0.0, 1.0, 1.0, 0.0]; dimension=2)
ψ_fz = cosh_itn(s; k=Number(pi), dimension=3)
ψ_fx = poly_itn(s, [0.0, 0.0, 0.0, 1.0]; dim=1)
ψ_fy = poly_itn(s, [0.0, 1.0, 1.0, 0.0]; dim=2)
ψ_fz = cosh_itn(s; k=Number(pi), dim=3)
ψxyz = ψ_fx * ψ_fy + ψ_fz

ψxyz = truncate(ψxyz; cutoff=1e-12)
Expand Down
6 changes: 3 additions & 3 deletions examples/fredholm_solver.jl
Original file line number Diff line number Diff line change
Expand Up @@ -47,13 +47,13 @@ println("solve f(x) = eˣ + ∫₀¹ (xy) f(y) dy")
s = continuous_siteinds(g; map_dimension=2)
ψ = const_itn(s) # f(x) = 1_x⊗1_y
# make g(x,y) = x*y
g = poly_itn(s, [0, 1]; dimension=1) * poly_itn(s, [0, 1]; dimension=2)
g = poly_itn(s, [0, 1]; dim=1) * poly_itn(s, [0, 1]; dim=2)

sU = union_all_inds(s.indsnetwork, s.indsnetwork')
∫_odd = ITensorNetwork(v -> v ∈ dimension_vertices(s, 1) ? Op("I") : Op("HalfInt"), sU)
∫_even = ITensorNetwork(v -> v ∈ dimension_vertices(s, 1) ? Op("HalfInt") : Op("I"), sU)
const_exp_odd = exp_itn(s; dimension=1)
const_exp_even = exp_itn(s; dimension=2)
const_exp_odd = exp_itn(s; dim=1)
const_exp_even = exp_itn(s; dim=2)

niter = 20
for iter in 1:niter
Expand Down
44 changes: 22 additions & 22 deletions src/elementary_functions.jl
Original file line number Diff line number Diff line change
Expand Up @@ -32,16 +32,16 @@ function exp_itensornetwork(
k=default_k_value(),
a=default_a_value(),
c=default_c_value(),
dimension::Int=default_dimension(),
dim::Int=default_dimension(),
)
ψ = const_itensornetwork(s)
Lx = length(dimension_vertices(ψ, dimension))
for v in dimension_vertices(ψ, dimension)
Lx = length(dimension_vertices(ψ, dim))
for v in dimension_vertices(ψ, dim)
sind = only(inds(s, v))
ψ[v] = ITensor(exp(a / Lx) * exp.(k * index_values_to_scalars(s, sind)), inds(ψ[v]))
end

ψ[first(dimension_vertices(ψ, dimension))] *= c
ψ[first(dimension_vertices(ψ, dim))] *= c

return ψ
end
Expand All @@ -53,10 +53,10 @@ function cosh_itensornetwork(
k=default_k_value(),
a=default_a_value(),
c=default_c_value(),
dimension::Int=default_dimension(),
dim::Int=default_dimension(),
)
ψ1 = exp_itensornetwork(s; a, k, c=0.5 * c, dimension)
ψ2 = exp_itensornetwork(s; a=-a, k=-k, c=0.5 * c, dimension)
ψ1 = exp_itensornetwork(s; a, k, c=0.5 * c, dim)
ψ2 = exp_itensornetwork(s; a=-a, k=-k, c=0.5 * c, dim)

return ψ1 + ψ2
end
Expand All @@ -68,10 +68,10 @@ function sinh_itensornetwork(
k=default_k_value(),
a=default_a_value(),
c=default_c_value(),
dimension::Int=default_dimension(),
dim::Int=default_dimension(),
)
ψ1 = exp_itensornetwork(s; a, k, c=0.5 * c, dimension)
ψ2 = exp_itensornetwork(s; a=-a, k=-k, c=-0.5 * c, dimension)
ψ1 = exp_itensornetwork(s; a, k, c=0.5 * c, dim)
ψ2 = exp_itensornetwork(s; a=-a, k=-k, c=-0.5 * c, dim)

return ψ1 + ψ2
end
Expand All @@ -84,16 +84,16 @@ function tanh_itensornetwork(
a=default_a_value(),
c=default_c_value(),
nterms::Int=default_nterms(),
dimension::Int=default_dimension(),
dim::Int=default_dimension(),
)
ψ = const_itensornetwork(s)
for n in 1:nterms
ψt = exp_itensornetwork(s; a=-2 * n * a, k=-2 * k * n, dimension)
ψt[first(dimension_vertices(ψ, dimension))] *= 2 * ((-1)^n)
ψt = exp_itensornetwork(s; a=-2 * n * a, k=-2 * k * n, dim)
ψt[first(dimension_vertices(ψ, dim))] *= 2 * ((-1)^n)
ψ = ψ + ψt
end

ψ[first(dimension_vertices(ψ, dimension))] *= c
ψ[first(dimension_vertices(ψ, dim))] *= c

return ψ
end
Expand All @@ -105,10 +105,10 @@ function cos_itensornetwork(
k=default_k_value(),
a=default_a_value(),
c=default_c_value(),
dimension::Int=default_dimension(),
dim::Int=default_dimension(),
)
ψ1 = exp_itensornetwork(s; a=a * im, k=k * im, c=0.5 * c, dimension)
ψ2 = exp_itensornetwork(s; a=-a * im, k=-k * im, c=0.5 * c, dimension)
ψ1 = exp_itensornetwork(s; a=a * im, k=k * im, c=0.5 * c, dim)
ψ2 = exp_itensornetwork(s; a=-a * im, k=-k * im, c=0.5 * c, dim)

return ψ1 + ψ2
end
Expand All @@ -120,10 +120,10 @@ function sin_itensornetwork(
k=default_k_value(),
a=default_a_value(),
c=default_c_value(),
dimension::Int=default_dimension(),
dim::Int=default_dimension(),
)
ψ1 = exp_itensornetwork(s; a=a * im, k=k * im, c=-0.5 * im * c, dimension)
ψ2 = exp_itensornetwork(s; a=-a * im, k=-k * im, c=0.5 * im * c, dimension)
ψ1 = exp_itensornetwork(s; a=a * im, k=k * im, c=-0.5 * im * c, dim)
ψ2 = exp_itensornetwork(s; a=-a * im, k=-k * im, c=0.5 * im * c, dim)

return ψ1 + ψ2
end
Expand All @@ -133,7 +133,7 @@ by indsnetwork"""
function polynomial_itensornetwork(
s::IndsNetworkMap,
coeffs::Vector;
dimension::Int=default_dimension(),
dim::Int=default_dimension(),
k=default_k_value(),
c=default_c_value(),
)
Expand All @@ -147,7 +147,7 @@ function polynomial_itensornetwork(
s_tree = IndsNetworkMap(s_tree, indexmap(s))

ψ = const_itensornetwork(s_tree; linkdim=n)
dim_vertices = dimension_vertices(ψ, dimension)
dim_vertices = dimension_vertices(ψ, dim)
source_vertex = first(dim_vertices)

for v in dim_vertices
Expand Down
62 changes: 28 additions & 34 deletions src/elementary_operators.jl
Original file line number Diff line number Diff line change
Expand Up @@ -22,28 +22,26 @@ default_boundary() = "Dirichlet"

## TODO: turn this into a proper system ala sites which can be externally overloaded

function boundary_term(
s::IndsNetworkMap, boundary::String, dimension, isfwd::Bool, n::Int=0
)
function boundary_term(s::IndsNetworkMap, boundary::String, dim, isfwd::Bool, n::Int=0)
ttn_op = OpSum()
dim_vertices = dimension_vertices(s, dimension)
dim_vertices = dimension_vertices(s, dim)
L = length(dim_vertices)

if boundary == "Neumann"
string_site = [
if j <= (L - n)
(isfwd ? "Dup" : "Ddn", vertex(s, dimension, j))
(isfwd ? "Dup" : "Ddn", vertex(s, dim, j))
else
("I", vertex(s, dimension, j))
("I", vertex(s, dim, j))
end for j in 1:L
]
add!(ttn_op, 1.0, (string_site...)...)
elseif boundary == "Periodic"
string_site = [
if j <= (L - n)
(isfwd ? "D-" : "D+", vertex(s, dimension, j))
(isfwd ? "D-" : "D+", vertex(s, dim, j))
else
("I", vertex(s, dimension, j))
("I", vertex(s, dim, j))
end for j in 1:L
]
add!(ttn_op, 1.0, (string_site...)...)
Expand All @@ -52,47 +50,47 @@ function boundary_term(
end

function forward_shift_opsum(
s::IndsNetworkMap; dimension=default_dimension(), boundary=default_boundary(), n::Int=0
s::IndsNetworkMap; dim=default_dimension(), boundary=default_boundary(), n::Int=0
)
@assert is_tree(s)
@assert base(s) == 2
ttn_op = OpSum()
dim_vertices = dimension_vertices(s, dimension)
dim_vertices = dimension_vertices(s, dim)
L = length(dim_vertices)

string_site = [("D+", vertex(s, dimension, L - n))]
add!(ttn_op, 1.0, "D+", vertex(s, dimension, L - n))
string_site = [("D+", vertex(s, dim, L - n))]
add!(ttn_op, 1.0, "D+", vertex(s, dim, L - n))
for i in (L - n):-1:2
pop!(string_site)
push!(string_site, ("D-", vertex(s, dimension, i)))
push!(string_site, ("D+", vertex(s, dimension, i - 1)))
push!(string_site, ("D-", vertex(s, dim, i)))
push!(string_site, ("D+", vertex(s, dim, i - 1)))
add!(ttn_op, 1.0, (string_site...)...)
end

ttn_op += boundary_term(s, boundary, dimension, true, n)
ttn_op += boundary_term(s, boundary, dim, true, n)

return ttn_op
end

function backward_shift_opsum(
s::IndsNetworkMap; dimension=default_dimension(), boundary=default_boundary(), n::Int=0
s::IndsNetworkMap; dim=default_dimension(), boundary=default_boundary(), n::Int=0
)
@assert is_tree(s)
@assert base(s) == 2
ttn_op = OpSum()
dim_vertices = dimension_vertices(s, dimension)
dim_vertices = dimension_vertices(s, dim)
L = length(dim_vertices)

string_site = [("D-", vertex(s, dimension, L - n))]
add!(ttn_op, 1.0, "D-", vertex(s, dimension, L - n))
string_site = [("D-", vertex(s, dim, L - n))]
add!(ttn_op, 1.0, "D-", vertex(s, dim, L - n))
for i in (L - n):-1:2
pop!(string_site)
push!(string_site, ("D+", vertex(s, dimension, i)))
push!(string_site, ("D-", vertex(s, dimension, i - 1)))
push!(string_site, ("D+", vertex(s, dim, i)))
push!(string_site, ("D-", vertex(s, dim, i - 1)))
add!(ttn_op, 1.0, (string_site...)...)
end

ttn_op += boundary_term(s, boundary, dimension, false, n)
ttn_op += boundary_term(s, boundary, dim, false, n)

return ttn_op
end
Expand All @@ -118,7 +116,7 @@ function stencil(
s::IndsNetworkMap,
shifts::Vector,
delta_power::Int;
dimension=default_dimension(),
dim=default_dimension(),
left_boundary=default_boundary(),
right_boundary=default_boundary(),
scale=true,
Expand All @@ -132,23 +130,21 @@ function stencil(
for i in [1, 2]
n = i == 1 ? 1 : 0
if !iszero(shifts[i])
stencil_opsum +=
shifts[i] * forward_shift_opsum(s; dimension, boundary=right_boundary, n)
stencil_opsum += shifts[i] * forward_shift_opsum(s; dim, boundary=right_boundary, n)
end
end

for i in [4, 5]
n = i == 5 ? 1 : 0
if !iszero(shifts[i])
stencil_opsum +=
shifts[i] * backward_shift_opsum(s; dimension, boundary=left_boundary, n)
stencil_opsum += shifts[i] * backward_shift_opsum(s; dim, boundary=left_boundary, n)
end
end

stencil_op = ttn(stencil_opsum, indsnetwork(s); kwargs...)

if scale
for v in dimension_vertices(s, dimension)
for v in dimension_vertices(s, dim)
stencil_op[v] = (b^delta_power) * stencil_op[v]
end
end
Expand All @@ -172,14 +168,12 @@ function fourth_derivative_operator(s::IndsNetworkMap; kwargs...)
return stencil(s, [1.0, -4.0, 6.0, -4.0, 1.0], 4; kwargs...)
end

function laplacian_operator(
s::IndsNetworkMap; dimensions=[i for i in 1:dimension(s)], kwargs...
)
remaining_dims = copy(dimensions)
∇ = second_derivative_operator(s; dimension=first(remaining_dims), kwargs...)
function laplacian_operator(s::IndsNetworkMap; dims=[i for i in 1:dimension(s)], kwargs...)
remaining_dims = copy(dims)
∇ = second_derivative_operator(s; dim=first(remaining_dims), kwargs...)
popfirst!(remaining_dims)
for rd in remaining_dims
∇ += second_derivative_operator(s; dimension=rd, kwargs...)
∇ += second_derivative_operator(s; dim=rd, kwargs...)
end
return ∇
end
Expand Down
Loading