Mercurial > repos > public > sbplib_julia
comparison test/SbpOperators/boundaryops/boundary_operator_test.jl @ 769:0158c3fd521c operator_storage_array_of_table
Merge in default
author | Jonatan Werpers <jonatan@werpers.com> |
---|---|
date | Thu, 15 Jul 2021 00:06:16 +0200 |
parents | 45966c77cb20 |
children | 18f63f1a0c44 47425442bbc5 469ed954b493 |
comparison
equal
deleted
inserted
replaced
768:7c87a33963c5 | 769:0158c3fd521c |
---|---|
1 using Test | |
2 | |
3 using Sbplib.LazyTensors | |
4 using Sbplib.SbpOperators | |
5 using Sbplib.Grids | |
6 using Sbplib.RegionIndices | |
7 import Sbplib.SbpOperators.Stencil | |
8 import Sbplib.SbpOperators.BoundaryOperator | |
9 import Sbplib.SbpOperators.boundary_operator | |
10 | |
11 @testset "BoundaryOperator" begin | |
12 closure_stencil = Stencil((0,2), (2.,1.,3.)) | |
13 g_1D = EquidistantGrid(11, 0.0, 1.0) | |
14 g_2D = EquidistantGrid((11,15), (0.0, 0.0), (1.0,1.0)) | |
15 | |
16 @testset "Constructors" begin | |
17 @testset "1D" begin | |
18 op_l = BoundaryOperator{Lower}(closure_stencil,size(g_1D)[1]) | |
19 @test op_l == BoundaryOperator(g_1D,closure_stencil,Lower()) | |
20 @test op_l == boundary_operator(g_1D,closure_stencil,CartesianBoundary{1,Lower}()) | |
21 @test op_l isa TensorMapping{T,0,1} where T | |
22 | |
23 op_r = BoundaryOperator{Upper}(closure_stencil,size(g_1D)[1]) | |
24 @test op_r == BoundaryOperator(g_1D,closure_stencil,Upper()) | |
25 @test op_r == boundary_operator(g_1D,closure_stencil,CartesianBoundary{1,Upper}()) | |
26 @test op_r isa TensorMapping{T,0,1} where T | |
27 end | |
28 | |
29 @testset "2D" begin | |
30 e_w = boundary_operator(g_2D,closure_stencil,CartesianBoundary{1,Upper}()) | |
31 @test e_w isa InflatedTensorMapping | |
32 @test e_w isa TensorMapping{T,1,2} where T | |
33 end | |
34 end | |
35 | |
36 op_l = boundary_operator(g_1D, closure_stencil, CartesianBoundary{1,Lower}()) | |
37 op_r = boundary_operator(g_1D, closure_stencil, CartesianBoundary{1,Upper}()) | |
38 | |
39 op_w = boundary_operator(g_2D, closure_stencil, CartesianBoundary{1,Lower}()) | |
40 op_e = boundary_operator(g_2D, closure_stencil, CartesianBoundary{1,Upper}()) | |
41 op_s = boundary_operator(g_2D, closure_stencil, CartesianBoundary{2,Lower}()) | |
42 op_n = boundary_operator(g_2D, closure_stencil, CartesianBoundary{2,Upper}()) | |
43 | |
44 @testset "Sizes" begin | |
45 @testset "1D" begin | |
46 @test domain_size(op_l) == (11,) | |
47 @test domain_size(op_r) == (11,) | |
48 | |
49 @test range_size(op_l) == () | |
50 @test range_size(op_r) == () | |
51 end | |
52 | |
53 @testset "2D" begin | |
54 @test domain_size(op_w) == (11,15) | |
55 @test domain_size(op_e) == (11,15) | |
56 @test domain_size(op_s) == (11,15) | |
57 @test domain_size(op_n) == (11,15) | |
58 | |
59 @test range_size(op_w) == (15,) | |
60 @test range_size(op_e) == (15,) | |
61 @test range_size(op_s) == (11,) | |
62 @test range_size(op_n) == (11,) | |
63 end | |
64 end | |
65 | |
66 @testset "Application" begin | |
67 @testset "1D" begin | |
68 v = evalOn(g_1D,x->1+x^2) | |
69 u = fill(3.124) | |
70 @test (op_l*v)[] == 2*v[1] + v[2] + 3*v[3] | |
71 @test (op_r*v)[] == 2*v[end] + v[end-1] + 3*v[end-2] | |
72 @test (op_r*v)[1] == 2*v[end] + v[end-1] + 3*v[end-2] | |
73 @test op_l'*u == [2*u[]; u[]; 3*u[]; zeros(8)] | |
74 @test op_r'*u == [zeros(8); 3*u[]; u[]; 2*u[]] | |
75 end | |
76 | |
77 @testset "2D" begin | |
78 v = rand(size(g_2D)...) | |
79 u = fill(3.124) | |
80 @test op_w*v ≈ 2*v[1,:] + v[2,:] + 3*v[3,:] rtol = 1e-14 | |
81 @test op_e*v ≈ 2*v[end,:] + v[end-1,:] + 3*v[end-2,:] rtol = 1e-14 | |
82 @test op_s*v ≈ 2*v[:,1] + v[:,2] + 3*v[:,3] rtol = 1e-14 | |
83 @test op_n*v ≈ 2*v[:,end] + v[:,end-1] + 3*v[:,end-2] rtol = 1e-14 | |
84 | |
85 | |
86 g_x = rand(size(g_2D)[1]) | |
87 g_y = rand(size(g_2D)[2]) | |
88 | |
89 G_w = zeros(Float64, size(g_2D)...) | |
90 G_w[1,:] = 2*g_y | |
91 G_w[2,:] = g_y | |
92 G_w[3,:] = 3*g_y | |
93 | |
94 G_e = zeros(Float64, size(g_2D)...) | |
95 G_e[end,:] = 2*g_y | |
96 G_e[end-1,:] = g_y | |
97 G_e[end-2,:] = 3*g_y | |
98 | |
99 G_s = zeros(Float64, size(g_2D)...) | |
100 G_s[:,1] = 2*g_x | |
101 G_s[:,2] = g_x | |
102 G_s[:,3] = 3*g_x | |
103 | |
104 G_n = zeros(Float64, size(g_2D)...) | |
105 G_n[:,end] = 2*g_x | |
106 G_n[:,end-1] = g_x | |
107 G_n[:,end-2] = 3*g_x | |
108 | |
109 @test op_w'*g_y == G_w | |
110 @test op_e'*g_y == G_e | |
111 @test op_s'*g_x == G_s | |
112 @test op_n'*g_x == G_n | |
113 end | |
114 | |
115 @testset "Regions" begin | |
116 u = fill(3.124) | |
117 @test (op_l'*u)[Index(1,Lower)] == 2*u[] | |
118 @test (op_l'*u)[Index(2,Lower)] == u[] | |
119 @test (op_l'*u)[Index(6,Interior)] == 0 | |
120 @test (op_l'*u)[Index(10,Upper)] == 0 | |
121 @test (op_l'*u)[Index(11,Upper)] == 0 | |
122 | |
123 @test (op_r'*u)[Index(1,Lower)] == 0 | |
124 @test (op_r'*u)[Index(2,Lower)] == 0 | |
125 @test (op_r'*u)[Index(6,Interior)] == 0 | |
126 @test (op_r'*u)[Index(10,Upper)] == u[] | |
127 @test (op_r'*u)[Index(11,Upper)] == 2*u[] | |
128 end | |
129 end | |
130 | |
131 @testset "Inferred" begin | |
132 v = ones(Float64, 11) | |
133 u = fill(1.) | |
134 | |
135 @inferred apply(op_l, v) | |
136 @inferred apply(op_r, v) | |
137 | |
138 @inferred apply_transpose(op_l, u, 4) | |
139 @inferred apply_transpose(op_l, u, Index(1,Lower)) | |
140 @inferred apply_transpose(op_l, u, Index(2,Lower)) | |
141 @inferred apply_transpose(op_l, u, Index(6,Interior)) | |
142 @inferred apply_transpose(op_l, u, Index(10,Upper)) | |
143 @inferred apply_transpose(op_l, u, Index(11,Upper)) | |
144 | |
145 @inferred apply_transpose(op_r, u, 4) | |
146 @inferred apply_transpose(op_r, u, Index(1,Lower)) | |
147 @inferred apply_transpose(op_r, u, Index(2,Lower)) | |
148 @inferred apply_transpose(op_r, u, Index(6,Interior)) | |
149 @inferred apply_transpose(op_r, u, Index(10,Upper)) | |
150 @inferred apply_transpose(op_r, u, Index(11,Upper)) | |
151 end | |
152 end |