Mercurial > repos > public > sbplib

comparison +sbp/D1Nonequidistant.m @ 258:a8d89688ba01 operator_remake

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merged nonequidistant into one class and cleaned up.
author Martin Almquist <martin.almquist@it.uu.se>
date Thu, 08 Sep 2016 13:28:35 +0200
parents
children a94bb3d92aba
comparison
equal deleted inserted replaced
257:5714fda0db85 258:a8d89688ba01
1 classdef D1Nonequidistant < sbp.OpSet
2 properties
3 D1 % SBP operator approximating first derivative
4 H % Norm matrix
5 HI % H^-1
6 Q % Skew-symmetric matrix
7 e_1 % Left boundary operator
8 e_m % Right boundary operator
9 m % Number of grid points.
10 h % Step size
11 x % grid
12 end
13
14 methods
15 function obj = D1Nonequidistant(m,L,order,option)
16
17 default_arg('option','Accurate');
18 % 'Accurate' operators are optimized for accuracy
19 % 'Minimal' operators have the smallest possible boundary
20 % closure
21
22 switch option
23
24 case {'Accurate','accurate','A'}
25
26 if order == 4
27 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_4th_4BP_2shifts(m,L);
28 elseif order == 6
29 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_6th_6BP_3shifts(m,L);
30 elseif order == 8
31 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_8th_8BP_4shifts(m,L);
32 elseif order == 10
33 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_10th_10BP_5shifts(m,L);
34 elseif order == 12
35 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_12th_12BP_6shifts(m,L);
36 else
37 error('Invalid operator order %d.',order);
38 end
39
40 case {'Minimal','minimal','M'}
41
42 if order == 4
43 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_minimal_4th_3BP_1shifts(m,L);
44 elseif order == 6
45 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_minimal_6th_5BP_2shifts(m,L);
46 elseif order == 8
47 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_minimal_8th_6BP_2shifts(m,L);
48 elseif order == 10
49 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_minimal_10th_8BP_3shifts(m,L);
50 elseif order == 12
51 [obj.D1,obj.H,obj.x,obj.h] = sbp.D1_minimal_12th_10BP_4shifts(m,L);
52 else
53 error('Invalid operator order %d.',order);
54 end
55
56 end
57
58 obj.e_1 = sparse(m,1);
59 obj.e_m = sparse(m,1);
60 obj.e_1(1) = 1;
61 obj.e_m(m) = 1;
62
63 obj.HI = inv(obj.H);
64 obj.Q = obj.H*obj.D1 - obj.e_m*obj.e_m' + obj.e_0*obj.e_0';
65
66 end
67 end
68
69 methods (Static)
70 function lambda = smallestGrid(obj)
71 error('Not implmented')
72 end
73 end
74 end
75
76
77
78
79