Mercurial > repos > public > sbplib
comparison +multiblock/DiffOpTimeDep.m @ 711:397d1b22cc37 feature/quantumTriangles
Changed closure and penalty ao that sparse matrices are created in DiffOpTimeDep
| author | Ylva Rydin <ylva.rydin@telia.com> |
|---|---|
| date | Thu, 30 Nov 2017 18:01:21 +0100 |
| parents | acb58769610e |
| children |
comparison
equal
deleted
inserted
replaced
| 710:023a95f63950 | 711:397d1b22cc37 |
|---|---|
| 161 switch class(boundary) | 161 switch class(boundary) |
| 162 case 'cell' | 162 case 'cell' |
| 163 [closure, penalty] = obj.singleBoundaryCondition(boundary, type); | 163 [closure, penalty] = obj.singleBoundaryCondition(boundary, type); |
| 164 case 'multiblock.BoundaryGroup' | 164 case 'multiblock.BoundaryGroup' |
| 165 nBlocks = obj.grid.nBlocks(); | 165 nBlocks = obj.grid.nBlocks(); |
| 166 %[n,m] = size(obj.D); | 166 [n,m] = size(obj.D{1,1}(0)); |
| 167 %closure = sparse(n,m); | 167 %closure = sparse(n,m); |
| 168 %penalty = sparse(n,0); | 168 %penalty = sparse(n,0); |
| 169 % closure =@(t)0; | 169 % closure =@(t)0; |
| 170 % penalty = @(t)0; | 170 % penalty = @(t)0; |
| 171 for i = 1:nBlocks | 171 for i = 1:nBlocks |
| 172 for j = 1:nBlocks | 172 for j = 1:nBlocks |
| 173 closure{j,i} = @(t)0; | 173 closure{j,i} = @(t)0*sparse(n,m); |
| 174 penalty{j,i} = @(t)0; | 174 penalty{j,i} = @(t)0*sparse(n,1); |
| 175 end | 175 end |
| 176 end | 176 end |
| 177 | 177 |
| 178 | 178 |
| 179 for i = 1:length(boundary) | 179 for i = 1:length(boundary) |