Mercurial > repos > public > sbplib

comparison +sbp/D1StaggeredUpwind.m @ 1331:60c875c18de3 feature/D2_boundary_opt

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge with feature/poroelastic for Elastic schemes
author Vidar Stiernström <vidar.stiernstrom@it.uu.se>
date Thu, 10 Mar 2022 16:54:26 +0100
parents a3f2c1781612
children
comparison
equal deleted inserted replaced
1330:855871e0b852 1331:60c875c18de3
1 classdef D1StaggeredUpwind < sbp.OpSet
2 % Compatible staggered and upwind operators by Ken Mattsson and Ossian O'reilly
3 properties
4 % x_primal: "primal" grid with m points. Equidistant. Called Plus grid in Ossian's paper.
5 % x_dual: "dual" grid with m+1 points. Called Minus grid in Ossian's paper.
6
7 % D1_primal takes FROM dual grid TO primal grid
8 % D1_dual takes FROM primal grid TO dual grid
9
10 D1_primal % SBP operator approximating first derivative
11 D1_dual % SBP operator approximating first derivative
12
13 Dplus_primal % Upwind operator on primal grid
14 Dminus_primal % Upwind operator on primal grid
15 Dplus_dual % Upwind operator on dual grid
16 Dminus_dual % Upwind operator on dual grid
17
18 H_primal % Norm matrix
19 H_dual % Norm matrix
20 H_primalI % H^-1
21 H_dualI % H^-1
22 e_primal_l % Left boundary operator
23 e_dual_l % Left boundary operator
24 e_primal_r % Right boundary operator
25 e_dual_r % Right boundary operator
26 m % Number of grid points.
27 m_primal % Number of grid points.
28 m_dual % Number of grid points.
29 h % Step size
30 x_primal % grid
31 x_dual % grid
32 x
33 borrowing % Struct with borrowing limits for different norm matrices
34 end
35
36 methods
37 function obj = D1StaggeredUpwind(m,lim,order)
38
39 xl = lim{1};
40 xr = lim{2};
41 L = xr-xl;
42 h = L/(m-1);
43
44 m_primal = m;
45 m_dual = m+1;
46
47 switch order
48 case 2
49 [~, ~, obj.H_primal, obj.H_dual,...
50 obj.H_primalI, obj.H_dualI,...
51 obj.D1_primal, obj.D1_dual, obj.Dplus_primal, obj.Dminus_primal,...
52 obj.Dplus_dual, obj.Dminus_dual] = sbp.implementations.d1_staggered_upwind_2(m, L);
53 case 4
54 [~, ~, obj.H_primal, obj.H_dual,...
55 obj.H_primalI, obj.H_dualI,...
56 obj.D1_primal, obj.D1_dual, obj.Dplus_primal, obj.Dminus_primal,...
57 obj.Dplus_dual, obj.Dminus_dual] = sbp.implementations.d1_staggered_upwind_4(m, L);
58 case 6
59 [~, ~, obj.H_primal, obj.H_dual,...
60 obj.H_primalI, obj.H_dualI,...
61 obj.D1_primal, obj.D1_dual, obj.Dplus_primal, obj.Dminus_primal,...
62 obj.Dplus_dual, obj.Dminus_dual] = sbp.implementations.d1_staggered_upwind_6(m, L);
63 case 8
64 [~, ~, obj.H_primal, obj.H_dual,...
65 obj.H_primalI, obj.H_dualI,...
66 obj.D1_primal, obj.D1_dual, obj.Dplus_primal, obj.Dminus_primal,...
67 obj.Dplus_dual, obj.Dminus_dual] = sbp.implementations.d1_staggered_upwind_8(m, L);
68 otherwise
69 error('Invalid operator order %d.',order);
70 end
71
72 obj.m = m;
73 obj.m_primal = m_primal;
74 obj.m_dual = m_dual;
75 obj.h = h;
76
77 obj.x_primal = linspace(xl, xr, m)';
78 obj.x_dual = [xl, linspace(xl+h/2, xr-h/2, m-1), xr]';
79
80 obj.e_primal_l = sparse(m_primal,1);
81 obj.e_primal_r = sparse(m_primal,1);
82 obj.e_primal_l(1) = 1;
83 obj.e_primal_r(m_primal) = 1;
84
85 obj.e_dual_l = sparse(m_dual,1);
86 obj.e_dual_r = sparse(m_dual,1);
87 obj.e_dual_l(1) = 1;
88 obj.e_dual_r(m_dual) = 1;
89
90 obj.borrowing = [];
91 obj.x = [];
92
93 end
94
95 function str = string(obj)
96 str = [class(obj) '_' num2str(obj.order)];
97 end
98 end
99 end