forked from simpeg/simpeg
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Problem.py
324 lines (254 loc) · 8.43 KB
/
Problem.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
from __future__ import print_function
from discretize.base import BaseMesh
from . import Utils
from . import Survey
from . import Models
import numpy as np
from . import Maps
from .Fields import Fields, TimeFields
from . import Mesh
from . import Props
import properties
Solver = Utils.SolverUtils.Solver
class BaseProblem(Props.HasModel):
"""Problem is the base class for all geophysical forward problems
in SimPEG.
"""
#: A SimPEG.Utils.Counter object
counter = None
#: A SimPEG.Survey Class
surveyPair = Survey.BaseSurvey
#: A SimPEG.Map Class
mapPair = Maps.IdentityMap
#: A SimPEG Solver class.
Solver = Solver
#: Solver options as a kwarg dict
solverOpts = {}
#: A discretize instance.
mesh = None
def __init__(self, mesh, **kwargs):
# raise exception if user tries to set "mapping"
if 'mapping' in kwargs:
raise Exception(
'Depreciated (in 0.4.0): use one of {}'.format(
[p for p in self._props.keys() if 'Map' in p]
)
)
super(BaseProblem, self).__init__(**kwargs)
assert isinstance(mesh, BaseMesh), (
"mesh must be a discretize object."
)
self.mesh = mesh
@property
def mapping(self):
"""Setting an unnamed mapping has been depreciated in
v0.4.0. Please see the release notes for more details.
"""
raise Exception(
'Depreciated (in 0.4.0): use one of {}'.format(
[p for p in self._props.keys() if 'Map' in p]
)
)
@mapping.setter
def mapping(self, value):
raise Exception(
'Depreciated (in 0.4.0): use one of {}'.format(
[p for p in self._props.keys() if 'Map' in p]
)
)
@property
def curModel(self):
"""
Setting the curModel is depreciated.
Use `SimPEG.Problem.model` instead.
"""
raise AttributeError(
'curModel is depreciated (in 0.4.0). Use '
'`SimPEG.Problem.model` instead'
)
@curModel.setter
def curModel(self, value):
raise AttributeError(
'curModel is depreciated (in 0.4.0). Use '
'`SimPEG.Problem.model` instead'
)
@property
def survey(self):
"""
The survey object for this problem.
"""
return getattr(self, '_survey', None)
def pair(self, d):
"""Bind a survey to this problem instance using pointers."""
assert isinstance(d, self.surveyPair), (
"Data object must be an instance of a {0!s} class.".format(
self.surveyPair.__name__
)
)
if d.ispaired:
raise Exception(
"The survey object is already paired to a problem. "
"Use survey.unpair()"
)
self._survey = d
d._prob = self
def unpair(self):
"""Unbind a survey from this problem instance."""
if not self.ispaired:
return
self.survey._prob = None
self._survey = None
#: List of strings, e.g. ['_MeSigma', '_MeSigmaI']
deleteTheseOnModelUpdate = []
#: List of matrix names to have their factors cleared on a model update
clean_on_model_update = []
@properties.observer('model')
def _on_model_update(self, change):
if change['previous'] is change['value']:
return
if (
isinstance(change['previous'], np.ndarray) and
isinstance(change['value'], np.ndarray) and
np.allclose(change['previous'], change['value'])
):
return
for prop in self.deleteTheseOnModelUpdate:
if hasattr(self, prop):
delattr(self, prop)
# matrix factors to clear
for mat in self.clean_on_model_update:
if getattr(self, mat, None) is not None:
getattr(self, mat).clean() # clean factors
setattr(self, mat, None) # set to none
@property
def ispaired(self):
"""True if the problem is paired to a survey."""
return self.survey is not None
@Utils.timeIt
def Jvec(self, m, v, f=None):
"""Jvec(m, v, f=None)
Effect of J(m) on a vector v.
:param numpy.array m: model
:param numpy.array v: vector to multiply
:param Fields f: fields
:rtype: numpy.array
:return: Jv
"""
raise NotImplementedError('J is not yet implemented.')
@Utils.timeIt
def Jtvec(self, m, v, f=None):
"""Jtvec(m, v, f=None)
Effect of transpose of J(m) on a vector v.
:param numpy.array m: model
:param numpy.array v: vector to multiply
:param Fields f: fields
:rtype: numpy.array
:return: JTv
"""
raise NotImplementedError('Jt is not yet implemented.')
@Utils.timeIt
def Jvec_approx(self, m, v, f=None):
"""Jvec_approx(m, v, f=None)
Approximate effect of J(m) on a vector v
:param numpy.array m: model
:param numpy.array v: vector to multiply
:param Fields f: fields
:rtype: numpy.array
:return: approxJv
"""
return self.Jvec(m, v, f)
@Utils.timeIt
def Jtvec_approx(self, m, v, f=None):
"""Jtvec_approx(m, v, f=None)
Approximate effect of transpose of J(m) on a vector v.
:param numpy.array m: model
:param numpy.array v: vector to multiply
:param Fields f: fields
:rtype: numpy.array
:return: JTv
"""
return self.Jtvec(m, v, f)
def fields(self, m):
"""The field given the model.
:param numpy.array m: model
:rtype: numpy.array
:return: u, the fields
"""
raise NotImplementedError('fields is not yet implemented.')
class BaseTimeProblem(BaseProblem):
"""Sets up that basic needs of a time domain problem."""
@property
def timeSteps(self):
"""Sets/gets the timeSteps for the time domain problem.
You can set as an array of dt's or as a list of tuples/floats.
Tuples must be length two with [..., (dt, repeat), ...]
For example, the following setters are the same::
prob.timeSteps = [(1e-6, 3), 1e-5, (1e-4, 2)]
prob.timeSteps = np.r_[1e-6,1e-6,1e-6,1e-5,1e-4,1e-4]
"""
return getattr(self, '_timeSteps', None)
@timeSteps.setter
def timeSteps(self, value):
if isinstance(value, np.ndarray):
self._timeSteps = value
del self.timeMesh
return
self._timeSteps = Utils.meshTensor(value)
del self.timeMesh
@property
def nT(self):
"Number of time steps."
return self.timeMesh.nC
@property
def t0(self):
return getattr(self, '_t0', 0.0)
@t0.setter
def t0(self, value):
assert np.isscalar(value), 't0 must be a scalar'
del self.timeMesh
self._t0 = float(value)
@property
def times(self):
"Modeling times"
return self.timeMesh.vectorNx
@property
def timeMesh(self):
if getattr(self, '_timeMesh', None) is None:
self._timeMesh = Mesh.TensorMesh([self.timeSteps], x0=[self.t0])
return self._timeMesh
@timeMesh.deleter
def timeMesh(self):
if hasattr(self, '_timeMesh'):
del self._timeMesh
class LinearProblem(BaseProblem):
# model, modelMap, modelDeriv = Props.Invertible(
# "Generic model parameters",
# default=1.
# )
G = None
def __init__(self, mesh, **kwargs):
BaseProblem.__init__(self, mesh, **kwargs)
self.modelMap = kwargs.pop('mapping', Maps.IdentityMap(mesh))
@property
def modelMap(self):
"A SimPEG.Map instance."
return getattr(self, '_modelMap', None)
@modelMap.setter
def modelMap(self, val):
val._assertMatchesPair(self.mapPair)
self._modelMap = val
def fields(self, m):
return self.G.dot(self.modelMap * m)
def getJ(self, m, f=None):
"""
Sensitivity matrix
"""
if self.modelMap is not None:
dmudm = self.modelMap.deriv(m)
return self.G*dmudm
else:
return self.G
def Jvec(self, m, v, f=None):
return self.G.dot(self.modelMap.deriv(m) * v)
def Jtvec(self, m, v, f=None):
return self.modelMap.deriv(m).T*self.G.T.dot(v)