[a45622a] | 1 | ##################################################################### |
---|
| 2 | #This software was developed by the University of Tennessee as part of the |
---|
| 3 | #Distributed Data Analysis of Neutron Scattering Experiments (DANSE) |
---|
| 4 | #project funded by the US National Science Foundation. |
---|
| 5 | #See the license text in license.txt |
---|
| 6 | #copyright 2010, University of Tennessee |
---|
| 7 | ###################################################################### |
---|
[2e94cbde] | 8 | |
---|
| 9 | """ |
---|
[a45622a] | 10 | This module implements invariant and its related computations. |
---|
[2e94cbde] | 11 | |
---|
[a45622a] | 12 | :author: Gervaise B. Alina/UTK |
---|
| 13 | :author: Mathieu Doucet/UTK |
---|
| 14 | :author: Jae Cho/UTK |
---|
[c75a8ed] | 15 | |
---|
[75047cf] | 16 | """ |
---|
| 17 | import math |
---|
[ef9ed58] | 18 | import numpy |
---|
[75047cf] | 19 | |
---|
[46d50ca] | 20 | from DataLoader.data_info import Data1D as LoaderData1D |
---|
[75047cf] | 21 | |
---|
[b6666d4] | 22 | # The minimum q-value to be used when extrapolating |
---|
| 23 | Q_MINIMUM = 1e-5 |
---|
| 24 | |
---|
| 25 | # The maximum q-value to be used when extrapolating |
---|
| 26 | Q_MAXIMUM = 10 |
---|
| 27 | |
---|
| 28 | # Number of steps in the extrapolation |
---|
| 29 | INTEGRATION_NSTEPS = 1000 |
---|
| 30 | |
---|
[59a41066] | 31 | class Transform(object): |
---|
[ef9ed58] | 32 | """ |
---|
[a45622a] | 33 | Define interface that need to compute a function or an inverse |
---|
| 34 | function given some x, y |
---|
[59a41066] | 35 | """ |
---|
[76c1727] | 36 | |
---|
| 37 | def linearize_data(self, data): |
---|
[59a41066] | 38 | """ |
---|
[a45622a] | 39 | Linearize data so that a linear fit can be performed. |
---|
| 40 | Filter out the data that can't be transformed. |
---|
| 41 | |
---|
| 42 | :param data: LoadData1D instance |
---|
| 43 | |
---|
[76c1727] | 44 | """ |
---|
| 45 | # Check that the vector lengths are equal |
---|
| 46 | assert(len(data.x)==len(data.y)) |
---|
| 47 | if data.dy is not None: |
---|
| 48 | assert(len(data.x)==len(data.dy)) |
---|
| 49 | dy = data.dy |
---|
| 50 | else: |
---|
[bdd162f] | 51 | dy = numpy.ones(len(data.y)) |
---|
[76c1727] | 52 | |
---|
| 53 | # Transform the data |
---|
[bdd162f] | 54 | data_points = zip(data.x, data.y, dy) |
---|
| 55 | |
---|
[76c1727] | 56 | output_points = [(self.linearize_q_value(p[0]), |
---|
| 57 | math.log(p[1]), |
---|
[cbaa2f4] | 58 | p[2]/p[1]) for p in data_points if p[0]>0 and \ |
---|
| 59 | p[1]>0 and p[2]>0] |
---|
[76c1727] | 60 | |
---|
| 61 | x_out, y_out, dy_out = zip(*output_points) |
---|
| 62 | |
---|
[bdd162f] | 63 | # Create Data1D object |
---|
[76c1727] | 64 | x_out = numpy.asarray(x_out) |
---|
| 65 | y_out = numpy.asarray(y_out) |
---|
| 66 | dy_out = numpy.asarray(dy_out) |
---|
[bdd162f] | 67 | linear_data = LoaderData1D(x=x_out, y=y_out, dy=dy_out) |
---|
[76c1727] | 68 | |
---|
| 69 | return linear_data |
---|
[bdd162f] | 70 | |
---|
| 71 | def get_allowed_bins(self, data): |
---|
[76c1727] | 72 | """ |
---|
[a45622a] | 73 | Goes through the data points and returns a list of boolean values |
---|
| 74 | to indicate whether each points is allowed by the model or not. |
---|
| 75 | |
---|
| 76 | :param data: Data1D object |
---|
[59a41066] | 77 | """ |
---|
[cbaa2f4] | 78 | return [p[0]>0 and p[1]>0 and p[2]>0 for p in zip(data.x, data.y, |
---|
| 79 | data.dy)] |
---|
[bdd162f] | 80 | |
---|
[aafa962] | 81 | def linearize_q_value(self, value): |
---|
[59a41066] | 82 | """ |
---|
[a45622a] | 83 | Transform the input q-value for linearization |
---|
[59a41066] | 84 | """ |
---|
[82703a1] | 85 | return NotImplemented |
---|
[aafa962] | 86 | |
---|
[bdd162f] | 87 | def extract_model_parameters(self, constant, slope, dconstant=0, dslope=0): |
---|
[59a41066] | 88 | """ |
---|
[a45622a] | 89 | set private member |
---|
[59a41066] | 90 | """ |
---|
[82703a1] | 91 | return NotImplemented |
---|
[aafa962] | 92 | |
---|
| 93 | def evaluate_model(self, x): |
---|
[59a41066] | 94 | """ |
---|
[a45622a] | 95 | Returns an array f(x) values where f is the Transform function. |
---|
[59a41066] | 96 | """ |
---|
[82703a1] | 97 | return NotImplemented |
---|
| 98 | |
---|
[bdd162f] | 99 | def evaluate_model_errors(self, x): |
---|
| 100 | """ |
---|
[a45622a] | 101 | Returns an array of I(q) errors |
---|
[bdd162f] | 102 | """ |
---|
| 103 | return NotImplemented |
---|
| 104 | |
---|
[59a41066] | 105 | class Guinier(Transform): |
---|
| 106 | """ |
---|
[a45622a] | 107 | class of type Transform that performs operations related to guinier |
---|
| 108 | function |
---|
[59a41066] | 109 | """ |
---|
| 110 | def __init__(self, scale=1, radius=60): |
---|
| 111 | Transform.__init__(self) |
---|
| 112 | self.scale = scale |
---|
| 113 | self.radius = radius |
---|
[bdd162f] | 114 | ## Uncertainty of scale parameter |
---|
| 115 | self.dscale = 0 |
---|
| 116 | ## Unvertainty of radius parameter |
---|
| 117 | self.dradius = 0 |
---|
[76c1727] | 118 | |
---|
[aafa962] | 119 | def linearize_q_value(self, value): |
---|
[82703a1] | 120 | """ |
---|
[a45622a] | 121 | Transform the input q-value for linearization |
---|
| 122 | |
---|
| 123 | :param value: q-value |
---|
| 124 | |
---|
| 125 | :return: q*q |
---|
[82703a1] | 126 | """ |
---|
| 127 | return value * value |
---|
[59a41066] | 128 | |
---|
[bdd162f] | 129 | def extract_model_parameters(self, constant, slope, dconstant=0, dslope=0): |
---|
[a45622a] | 130 | """ |
---|
| 131 | assign new value to the scale and the radius |
---|
[82703a1] | 132 | """ |
---|
[bdd162f] | 133 | self.scale = math.exp(constant) |
---|
| 134 | self.radius = math.sqrt(-3 * slope) |
---|
| 135 | |
---|
| 136 | # Errors |
---|
| 137 | self.dscale = math.exp(constant)*dconstant |
---|
| 138 | self.dradius = -3.0/2.0/math.sqrt(-3 * slope)*dslope |
---|
[59a41066] | 139 | |
---|
[c4f52e3] | 140 | return [self.radius, self.scale], [self.dradius, self.dscale] |
---|
| 141 | |
---|
[aafa962] | 142 | def evaluate_model(self, x): |
---|
[59a41066] | 143 | """ |
---|
[a45622a] | 144 | return F(x)= scale* e-((radius*x)**2/3) |
---|
[59a41066] | 145 | """ |
---|
| 146 | return self._guinier(x) |
---|
[aafa962] | 147 | |
---|
[bdd162f] | 148 | def evaluate_model_errors(self, x): |
---|
| 149 | """ |
---|
[a45622a] | 150 | Returns the error on I(q) for the given array of q-values |
---|
| 151 | |
---|
| 152 | :param x: array of q-values |
---|
[bdd162f] | 153 | """ |
---|
[cbaa2f4] | 154 | p1 = numpy.array([self.dscale * math.exp(-((self.radius * q)**2/3)) \ |
---|
| 155 | for q in x]) |
---|
| 156 | p2 = numpy.array([self.scale * math.exp(-((self.radius * q)**2/3))\ |
---|
| 157 | * (-(q**2/3)) * 2 * self.radius * self.dradius for q in x]) |
---|
[bdd162f] | 158 | diq2 = p1*p1 + p2*p2 |
---|
| 159 | return numpy.array( [math.sqrt(err) for err in diq2] ) |
---|
| 160 | |
---|
[59a41066] | 161 | def _guinier(self, x): |
---|
| 162 | """ |
---|
[a45622a] | 163 | Retrive the guinier function after apply an inverse guinier function |
---|
| 164 | to x |
---|
| 165 | Compute a F(x) = scale* e-((radius*x)**2/3). |
---|
| 166 | |
---|
| 167 | :param x: a vector of q values |
---|
| 168 | :param scale: the scale value |
---|
| 169 | :param radius: the guinier radius value |
---|
| 170 | |
---|
| 171 | :return: F(x) |
---|
[59a41066] | 172 | """ |
---|
| 173 | # transform the radius of coming from the inverse guinier function to a |
---|
| 174 | # a radius of a guinier function |
---|
| 175 | if self.radius <= 0: |
---|
[cbaa2f4] | 176 | msg = "Rg expected positive value, but got %s"%self.radius |
---|
| 177 | raise ValueError(msg) |
---|
[59a41066] | 178 | value = numpy.array([math.exp(-((self.radius * i)**2/3)) for i in x ]) |
---|
| 179 | return self.scale * value |
---|
| 180 | |
---|
| 181 | class PowerLaw(Transform): |
---|
| 182 | """ |
---|
[a45622a] | 183 | class of type transform that perform operation related to power_law |
---|
| 184 | function |
---|
[ef9ed58] | 185 | """ |
---|
[59a41066] | 186 | def __init__(self, scale=1, power=4): |
---|
| 187 | Transform.__init__(self) |
---|
| 188 | self.scale = scale |
---|
| 189 | self.power = power |
---|
[76c1727] | 190 | |
---|
[aafa962] | 191 | def linearize_q_value(self, value): |
---|
| 192 | """ |
---|
[a45622a] | 193 | Transform the input q-value for linearization |
---|
| 194 | |
---|
| 195 | :param value: q-value |
---|
| 196 | |
---|
| 197 | :return: log(q) |
---|
[aafa962] | 198 | """ |
---|
| 199 | return math.log(value) |
---|
| 200 | |
---|
[bdd162f] | 201 | def extract_model_parameters(self, constant, slope, dconstant=0, dslope=0): |
---|
[82703a1] | 202 | """ |
---|
[a45622a] | 203 | Assign new value to the scale and the power |
---|
[82703a1] | 204 | """ |
---|
[bdd162f] | 205 | self.power = -slope |
---|
| 206 | self.scale = math.exp(constant) |
---|
| 207 | |
---|
| 208 | # Errors |
---|
| 209 | self.dscale = math.exp(constant)*dconstant |
---|
[c4f52e3] | 210 | self.dpower = -dslope |
---|
| 211 | |
---|
| 212 | return [self.power, self.scale], [self.dpower, self.dscale] |
---|
[82703a1] | 213 | |
---|
[aafa962] | 214 | def evaluate_model(self, x): |
---|
[59a41066] | 215 | """ |
---|
[a45622a] | 216 | given a scale and a radius transform x, y using a power_law |
---|
| 217 | function |
---|
[59a41066] | 218 | """ |
---|
| 219 | return self._power_law(x) |
---|
[bdd162f] | 220 | |
---|
| 221 | def evaluate_model_errors(self, x): |
---|
| 222 | """ |
---|
[a45622a] | 223 | Returns the error on I(q) for the given array of q-values |
---|
| 224 | :param x: array of q-values |
---|
[bdd162f] | 225 | """ |
---|
| 226 | p1 = numpy.array([self.dscale * math.pow(q, -self.power) for q in x]) |
---|
[cbaa2f4] | 227 | p2 = numpy.array([self.scale * self.power * math.pow(q, -self.power-1)\ |
---|
| 228 | * self.dpower for q in x]) |
---|
[bdd162f] | 229 | diq2 = p1*p1 + p2*p2 |
---|
| 230 | return numpy.array( [math.sqrt(err) for err in diq2] ) |
---|
[59a41066] | 231 | |
---|
| 232 | def _power_law(self, x): |
---|
| 233 | """ |
---|
[a45622a] | 234 | F(x) = scale* (x)^(-power) |
---|
| 235 | when power= 4. the model is porod |
---|
| 236 | else power_law |
---|
| 237 | The model has three parameters: :: |
---|
| 238 | 1. x: a vector of q values |
---|
| 239 | 2. power: power of the function |
---|
| 240 | 3. scale : scale factor value |
---|
| 241 | |
---|
| 242 | :param x: array |
---|
| 243 | :return: F(x) |
---|
[59a41066] | 244 | """ |
---|
| 245 | if self.power <= 0: |
---|
[cbaa2f4] | 246 | msg = "Power_law function expected positive power," |
---|
| 247 | msg += " but got %s"%self.power |
---|
| 248 | raise ValueError(msg) |
---|
[59a41066] | 249 | if self.scale <= 0: |
---|
[cbaa2f4] | 250 | msg = "scale expected positive value, but got %s"%self.scale |
---|
| 251 | raise ValueError(msg) |
---|
[59a41066] | 252 | |
---|
| 253 | value = numpy.array([ math.pow(i, -self.power) for i in x ]) |
---|
| 254 | return self.scale * value |
---|
[ef9ed58] | 255 | |
---|
[59a41066] | 256 | class Extrapolator: |
---|
[75047cf] | 257 | """ |
---|
[a45622a] | 258 | Extrapolate I(q) distribution using a given model |
---|
[75047cf] | 259 | """ |
---|
[bdd162f] | 260 | def __init__(self, data, model=None): |
---|
[75047cf] | 261 | """ |
---|
[a45622a] | 262 | Determine a and b given a linear equation y = ax + b |
---|
| 263 | |
---|
| 264 | If a model is given, it will be used to linearize the data before |
---|
[cbaa2f4] | 265 | the extrapolation is performed. If None, |
---|
| 266 | a simple linear fit will be done. |
---|
[a45622a] | 267 | |
---|
| 268 | :param data: data containing x and y such as y = ax + b |
---|
| 269 | :param model: optional Transform object |
---|
[75047cf] | 270 | """ |
---|
| 271 | self.data = data |
---|
[bdd162f] | 272 | self.model = model |
---|
[59a41066] | 273 | |
---|
[2a11d09] | 274 | # Set qmin as the lowest non-zero value |
---|
| 275 | self.qmin = Q_MINIMUM |
---|
| 276 | for q_value in self.data.x: |
---|
[59a41066] | 277 | if q_value > 0: |
---|
[2a11d09] | 278 | self.qmin = q_value |
---|
| 279 | break |
---|
| 280 | self.qmax = max(self.data.x) |
---|
[bdd162f] | 281 | |
---|
| 282 | def fit(self, power=None, qmin=None, qmax=None): |
---|
[75047cf] | 283 | """ |
---|
[a45622a] | 284 | Fit data for y = ax + b return a and b |
---|
| 285 | |
---|
| 286 | :param power: a fixed, otherwise None |
---|
| 287 | :param qmin: Minimum Q-value |
---|
| 288 | :param qmax: Maximum Q-value |
---|
[75047cf] | 289 | """ |
---|
[bdd162f] | 290 | if qmin is None: |
---|
| 291 | qmin = self.qmin |
---|
| 292 | if qmax is None: |
---|
| 293 | qmax = self.qmax |
---|
| 294 | |
---|
| 295 | # Identify the bin range for the fit |
---|
| 296 | idx = (self.data.x >= qmin) & (self.data.x <= qmax) |
---|
| 297 | |
---|
[437a9f0] | 298 | fx = numpy.zeros(len(self.data.x)) |
---|
[59a41066] | 299 | |
---|
[bdd162f] | 300 | # Uncertainty |
---|
[cbaa2f4] | 301 | if type(self.data.dy)==numpy.ndarray and \ |
---|
| 302 | len(self.data.dy)==len(self.data.x): |
---|
[3082632] | 303 | sigma = self.data.dy |
---|
[2a11d09] | 304 | else: |
---|
| 305 | sigma = numpy.ones(len(self.data.x)) |
---|
[59a41066] | 306 | |
---|
[9b6497bb] | 307 | # Compute theory data f(x) |
---|
[bdd162f] | 308 | fx[idx] = self.data.y[idx] |
---|
[472b11c] | 309 | |
---|
[bdd162f] | 310 | # Linearize the data |
---|
| 311 | if self.model is not None: |
---|
[cbaa2f4] | 312 | linearized_data = self.model.linearize_data(\ |
---|
| 313 | LoaderData1D(self.data.x[idx], |
---|
[bdd162f] | 314 | fx[idx], |
---|
[cbaa2f4] | 315 | dy = sigma[idx])) |
---|
[bdd162f] | 316 | else: |
---|
| 317 | linearized_data = LoaderData1D(self.data.x[idx], |
---|
| 318 | fx[idx], |
---|
| 319 | dy = sigma[idx]) |
---|
[59a41066] | 320 | |
---|
[472b11c] | 321 | ##power is given only for function = power_law |
---|
| 322 | if power != None: |
---|
[bdd162f] | 323 | sigma2 = linearized_data.dy * linearized_data.dy |
---|
[eb62193] | 324 | a = -(power) |
---|
[bdd162f] | 325 | b = (numpy.sum(linearized_data.y/sigma2) \ |
---|
| 326 | - a*numpy.sum(linearized_data.x/sigma2))/numpy.sum(1.0/sigma2) |
---|
| 327 | |
---|
[82703a1] | 328 | |
---|
[cbaa2f4] | 329 | deltas = linearized_data.x*a + \ |
---|
| 330 | numpy.ones(len(linearized_data.x))*b-linearized_data.y |
---|
[bdd162f] | 331 | residuals = numpy.sum(deltas*deltas/sigma2) |
---|
| 332 | |
---|
| 333 | err = math.fabs(residuals) / numpy.sum(1.0/sigma2) |
---|
| 334 | return [a, b], [0, math.sqrt(err)] |
---|
| 335 | else: |
---|
| 336 | A = numpy.vstack([ linearized_data.x/linearized_data.dy, |
---|
| 337 | 1.0/linearized_data.dy]).T |
---|
[cbaa2f4] | 338 | (p, residuals, rank, s) = numpy.linalg.lstsq(A, |
---|
| 339 | linearized_data.y/linearized_data.dy) |
---|
[bdd162f] | 340 | |
---|
| 341 | # Get the covariance matrix, defined as inv_cov = a_transposed * a |
---|
| 342 | err = numpy.zeros(2) |
---|
| 343 | try: |
---|
| 344 | inv_cov = numpy.dot(A.transpose(), A) |
---|
| 345 | cov = numpy.linalg.pinv(inv_cov) |
---|
| 346 | err_matrix = math.fabs(residuals) * cov |
---|
| 347 | err = [math.sqrt(err_matrix[0][0]), math.sqrt(err_matrix[1][1])] |
---|
| 348 | except: |
---|
| 349 | err = [-1.0, -1.0] |
---|
| 350 | |
---|
| 351 | return p, err |
---|
[aafa962] | 352 | |
---|
[b6666d4] | 353 | |
---|
[75047cf] | 354 | class InvariantCalculator(object): |
---|
| 355 | """ |
---|
[a45622a] | 356 | Compute invariant if data is given. |
---|
| 357 | Can provide volume fraction and surface area if the user provides |
---|
| 358 | Porod constant and contrast values. |
---|
| 359 | |
---|
| 360 | :precondition: the user must send a data of type DataLoader.Data1D |
---|
| 361 | the user provide background and scale values. |
---|
| 362 | |
---|
| 363 | :note: Some computations depends on each others. |
---|
[75047cf] | 364 | """ |
---|
| 365 | def __init__(self, data, background=0, scale=1 ): |
---|
| 366 | """ |
---|
[a45622a] | 367 | Initialize variables. |
---|
| 368 | |
---|
| 369 | :param data: data must be of type DataLoader.Data1D |
---|
[cbaa2f4] | 370 | :param background: Background value. The data will be corrected |
---|
| 371 | before processing |
---|
| 372 | :param scale: Scaling factor for I(q). The data will be corrected |
---|
| 373 | before processing |
---|
[75047cf] | 374 | """ |
---|
[b6666d4] | 375 | # Background and scale should be private data member if the only way to |
---|
| 376 | # change them are by instantiating a new object. |
---|
| 377 | self._background = background |
---|
| 378 | self._scale = scale |
---|
[7182d96] | 379 | # slit height for smeared data |
---|
| 380 | self._smeared = None |
---|
[b6666d4] | 381 | # The data should be private |
---|
| 382 | self._data = self._get_data(data) |
---|
[7182d96] | 383 | # get the dxl if the data is smeared: This is done only once on init. |
---|
[16f60cb] | 384 | if self._data.dxl != None and self._data.dxl.all() >0: |
---|
[7182d96] | 385 | # assumes constant dxl |
---|
[16f60cb] | 386 | self._smeared = self._data.dxl[0] |
---|
[f31ab59] | 387 | |
---|
[b6666d4] | 388 | # Since there are multiple variants of Q*, you should force the |
---|
| 389 | # user to use the get method and keep Q* a private data member |
---|
| 390 | self._qstar = None |
---|
| 391 | |
---|
| 392 | # You should keep the error on Q* so you can reuse it without |
---|
| 393 | # recomputing the whole thing. |
---|
| 394 | self._qstar_err = 0 |
---|
[75047cf] | 395 | |
---|
[b6666d4] | 396 | # Extrapolation parameters |
---|
| 397 | self._low_extrapolation_npts = 4 |
---|
[59a41066] | 398 | self._low_extrapolation_function = Guinier() |
---|
[4e80ae0] | 399 | self._low_extrapolation_power = None |
---|
[90e5ca1] | 400 | self._low_extrapolation_power_fitted = None |
---|
[ef9ed58] | 401 | |
---|
[b6666d4] | 402 | self._high_extrapolation_npts = 4 |
---|
[59a41066] | 403 | self._high_extrapolation_function = PowerLaw() |
---|
[4e80ae0] | 404 | self._high_extrapolation_power = None |
---|
[90e5ca1] | 405 | self._high_extrapolation_power_fitted = None |
---|
[75047cf] | 406 | |
---|
[2e94cbde] | 407 | # Extrapolation range |
---|
| 408 | self._low_q_limit = Q_MINIMUM |
---|
| 409 | |
---|
[b6666d4] | 410 | def _get_data(self, data): |
---|
[75047cf] | 411 | """ |
---|
[a45622a] | 412 | :note: this function must be call before computing any type |
---|
| 413 | of invariant |
---|
| 414 | |
---|
| 415 | :return: new data = self._scale *data - self._background |
---|
[75047cf] | 416 | """ |
---|
[b6666d4] | 417 | if not issubclass(data.__class__, LoaderData1D): |
---|
| 418 | #Process only data that inherited from DataLoader.Data_info.Data1D |
---|
| 419 | raise ValueError,"Data must be of type DataLoader.Data1D" |
---|
[6d55d81] | 420 | #from copy import deepcopy |
---|
[82703a1] | 421 | new_data = (self._scale * data) - self._background |
---|
[bdd162f] | 422 | |
---|
| 423 | # Check that the vector lengths are equal |
---|
| 424 | assert(len(new_data.x)==len(new_data.y)) |
---|
| 425 | |
---|
| 426 | # Verify that the errors are set correctly |
---|
| 427 | if new_data.dy is None or len(new_data.x) != len(new_data.dy) or \ |
---|
| 428 | (min(new_data.dy)==0 and max(new_data.dy)==0): |
---|
| 429 | new_data.dy = numpy.ones(len(new_data.x)) |
---|
[82703a1] | 430 | return new_data |
---|
| 431 | |
---|
[c4f52e3] | 432 | def _fit(self, model, qmin=Q_MINIMUM, qmax=Q_MAXIMUM, power=None): |
---|
[75047cf] | 433 | """ |
---|
[a45622a] | 434 | fit data with function using |
---|
| 435 | data = self._get_data() |
---|
| 436 | fx = Functor(data , function) |
---|
| 437 | y = data.y |
---|
| 438 | slope, constant = linalg.lstsq(y,fx) |
---|
| 439 | |
---|
| 440 | :param qmin: data first q value to consider during the fit |
---|
| 441 | :param qmax: data last q value to consider during the fit |
---|
| 442 | :param power : power value to consider for power-law |
---|
| 443 | :param function: the function to use during the fit |
---|
| 444 | |
---|
| 445 | :return a: the scale of the function |
---|
| 446 | :return b: the other parameter of the function for guinier will be radius |
---|
| 447 | for power_law will be the power value |
---|
[ef9ed58] | 448 | """ |
---|
[bdd162f] | 449 | extrapolator = Extrapolator(data=self._data, model=model) |
---|
| 450 | p, dp = extrapolator.fit(power=power, qmin=qmin, qmax=qmax) |
---|
[82703a1] | 451 | |
---|
[cbaa2f4] | 452 | return model.extract_model_parameters(constant=p[1], slope=p[0], |
---|
| 453 | dconstant=dp[1], dslope=dp[0]) |
---|
[ef9ed58] | 454 | |
---|
| 455 | def _get_qstar(self, data): |
---|
[75047cf] | 456 | """ |
---|
[a45622a] | 457 | Compute invariant for pinhole data. |
---|
| 458 | This invariant is given by: :: |
---|
| 459 | |
---|
| 460 | q_star = x0**2 *y0 *dx0 +x1**2 *y1 *dx1 |
---|
[7182d96] | 461 | + ..+ xn**2 *yn *dxn for non smeared data |
---|
| 462 | |
---|
| 463 | q_star = dxl0 *x0 *y0 *dx0 +dxl1 *x1 *y1 *dx1 |
---|
| 464 | + ..+ dlxn *xn *yn *dxn for smeared data |
---|
[a45622a] | 465 | |
---|
[669aaf9] | 466 | where n >= len(data.x)-1 |
---|
[7182d96] | 467 | dxl = slit height dQl |
---|
[75047cf] | 468 | dxi = 1/2*(xi+1 - xi) + (xi - xi-1) |
---|
[3bb37ef] | 469 | dx0 = (x1 - x0)/2 |
---|
| 470 | dxn = (xn - xn-1)/2 |
---|
[a45622a] | 471 | |
---|
| 472 | :param data: the data to use to compute invariant. |
---|
| 473 | |
---|
| 474 | :return q_star: invariant value for pinhole data. q_star > 0 |
---|
[75047cf] | 475 | """ |
---|
[ef9ed58] | 476 | if len(data.x) <= 1 or len(data.y) <= 1 or len(data.x)!= len(data.y): |
---|
| 477 | msg = "Length x and y must be equal" |
---|
[cbaa2f4] | 478 | msg += " and greater than 1; got x=%s, y=%s"%(len(data.x), |
---|
| 479 | len(data.y)) |
---|
[ef9ed58] | 480 | raise ValueError, msg |
---|
| 481 | else: |
---|
[7182d96] | 482 | # Take care of smeared data |
---|
| 483 | if self._smeared is None: |
---|
| 484 | gx = data.x * data.x |
---|
| 485 | # assumes that len(x) == len(dxl). |
---|
| 486 | else: |
---|
| 487 | gx = data.dxl * data.x |
---|
| 488 | |
---|
[ef9ed58] | 489 | n = len(data.x)- 1 |
---|
| 490 | #compute the first delta q |
---|
[3bb37ef] | 491 | dx0 = (data.x[1] - data.x[0])/2 |
---|
[ef9ed58] | 492 | #compute the last delta q |
---|
[3bb37ef] | 493 | dxn = (data.x[n] - data.x[n-1])/2 |
---|
[ef9ed58] | 494 | sum = 0 |
---|
[7182d96] | 495 | sum += gx[0] * data.y[0] * dx0 |
---|
| 496 | sum += gx[n] * data.y[n] * dxn |
---|
[ef9ed58] | 497 | |
---|
| 498 | if len(data.x) == 2: |
---|
| 499 | return sum |
---|
| 500 | else: |
---|
[cbaa2f4] | 501 | #iterate between for element different |
---|
| 502 | #from the first and the last |
---|
[ef9ed58] | 503 | for i in xrange(1, n-1): |
---|
| 504 | dxi = (data.x[i+1] - data.x[i-1])/2 |
---|
[7182d96] | 505 | sum += gx[i] * data.y[i] * dxi |
---|
[ef9ed58] | 506 | return sum |
---|
| 507 | |
---|
[bdd162f] | 508 | def _get_qstar_uncertainty(self, data): |
---|
[75047cf] | 509 | """ |
---|
[a45622a] | 510 | Compute invariant uncertainty with with pinhole data. |
---|
| 511 | This uncertainty is given as follow: :: |
---|
| 512 | |
---|
| 513 | dq_star = math.sqrt[(x0**2*(dy0)*dx0)**2 + |
---|
| 514 | (x1**2 *(dy1)*dx1)**2 + ..+ (xn**2 *(dyn)*dxn)**2 ] |
---|
| 515 | where n >= len(data.x)-1 |
---|
| 516 | dxi = 1/2*(xi+1 - xi) + (xi - xi-1) |
---|
| 517 | dx0 = (x1 - x0)/2 |
---|
| 518 | dxn = (xn - xn-1)/2 |
---|
| 519 | dyn: error on dy |
---|
| 520 | |
---|
| 521 | :param data: |
---|
| 522 | :note: if data doesn't contain dy assume dy= math.sqrt(data.y) |
---|
[bdd162f] | 523 | """ |
---|
[ef9ed58] | 524 | if len(data.x) <= 1 or len(data.y) <= 1 or \ |
---|
[bdd162f] | 525 | len(data.x) != len(data.y) or \ |
---|
| 526 | (data.dy is not None and (len(data.dy) != len(data.y))): |
---|
[ef9ed58] | 527 | msg = "Length of data.x and data.y must be equal" |
---|
| 528 | msg += " and greater than 1; got x=%s, y=%s"%(len(data.x), |
---|
| 529 | len(data.y)) |
---|
| 530 | raise ValueError, msg |
---|
| 531 | else: |
---|
| 532 | #Create error for data without dy error |
---|
[bdd162f] | 533 | if data.dy is None: |
---|
[ef9ed58] | 534 | dy = math.sqrt(y) |
---|
| 535 | else: |
---|
| 536 | dy = data.dy |
---|
[7182d96] | 537 | # Take care of smeared data |
---|
| 538 | if self._smeared is None: |
---|
| 539 | gx = data.x * data.x |
---|
| 540 | # assumes that len(x) == len(dxl). |
---|
| 541 | else: |
---|
| 542 | gx = data.dxl * data.x |
---|
| 543 | |
---|
[ef9ed58] | 544 | n = len(data.x) - 1 |
---|
| 545 | #compute the first delta |
---|
[3bb37ef] | 546 | dx0 = (data.x[1] - data.x[0])/2 |
---|
[ef9ed58] | 547 | #compute the last delta |
---|
[3bb37ef] | 548 | dxn= (data.x[n] - data.x[n-1])/2 |
---|
[ef9ed58] | 549 | sum = 0 |
---|
[7182d96] | 550 | sum += (gx[0] * dy[0] * dx0)**2 |
---|
| 551 | sum += (gx[n] * dy[n] * dxn)**2 |
---|
[ef9ed58] | 552 | if len(data.x) == 2: |
---|
| 553 | return math.sqrt(sum) |
---|
| 554 | else: |
---|
[cbaa2f4] | 555 | #iterate between for element different |
---|
| 556 | #from the first and the last |
---|
[ef9ed58] | 557 | for i in xrange(1, n-1): |
---|
| 558 | dxi = (data.x[i+1] - data.x[i-1])/2 |
---|
[7182d96] | 559 | sum += (gx[i] * dy[i] * dxi)**2 |
---|
[ef9ed58] | 560 | return math.sqrt(sum) |
---|
[b6666d4] | 561 | |
---|
[aafa962] | 562 | def _get_extrapolated_data(self, model, npts=INTEGRATION_NSTEPS, |
---|
| 563 | q_start=Q_MINIMUM, q_end=Q_MAXIMUM): |
---|
| 564 | """ |
---|
[a45622a] | 565 | :return: extrapolate data create from data |
---|
[aafa962] | 566 | """ |
---|
| 567 | #create new Data1D to compute the invariant |
---|
| 568 | q = numpy.linspace(start=q_start, |
---|
[bdd162f] | 569 | stop=q_end, |
---|
| 570 | num=npts, |
---|
| 571 | endpoint=True) |
---|
[aafa962] | 572 | iq = model.evaluate_model(q) |
---|
[bdd162f] | 573 | diq = model.evaluate_model_errors(q) |
---|
[aafa962] | 574 | |
---|
[bdd162f] | 575 | result_data = LoaderData1D(x=q, y=iq, dy=diq) |
---|
[7182d96] | 576 | if self._smeared != None: |
---|
| 577 | result_data.dxl = self._smeared * numpy.ones(len(q)) |
---|
[aafa962] | 578 | return result_data |
---|
[76c1727] | 579 | |
---|
[6d55d81] | 580 | def get_data(self): |
---|
| 581 | """ |
---|
[a45622a] | 582 | :return: self._data |
---|
[6d55d81] | 583 | """ |
---|
| 584 | return self._data |
---|
| 585 | |
---|
[90e5ca1] | 586 | def get_extrapolation_power(self, range='high'): |
---|
| 587 | """ |
---|
[cbaa2f4] | 588 | :return: the fitted power for power law function for a given |
---|
| 589 | extrapolation range |
---|
[90e5ca1] | 590 | """ |
---|
| 591 | if range == 'low': |
---|
| 592 | return self._low_extrapolation_power_fitted |
---|
| 593 | return self._high_extrapolation_power_fitted |
---|
| 594 | |
---|
[bdd162f] | 595 | def get_qstar_low(self): |
---|
[75047cf] | 596 | """ |
---|
[a45622a] | 597 | Compute the invariant for extrapolated data at low q range. |
---|
| 598 | |
---|
| 599 | Implementation: |
---|
| 600 | data = self._get_extra_data_low() |
---|
| 601 | return self._get_qstar() |
---|
[b6666d4] | 602 | |
---|
[a45622a] | 603 | :return q_star: the invariant for data extrapolated at low q. |
---|
[75047cf] | 604 | """ |
---|
[aafa962] | 605 | # Data boundaries for fitting |
---|
[ef9ed58] | 606 | qmin = self._data.x[0] |
---|
[437a9f0] | 607 | qmax = self._data.x[self._low_extrapolation_npts - 1] |
---|
[aafa962] | 608 | |
---|
[2a11d09] | 609 | # Extrapolate the low-Q data |
---|
[c4f52e3] | 610 | p, dp = self._fit(model=self._low_extrapolation_function, |
---|
| 611 | qmin=qmin, |
---|
| 612 | qmax=qmax, |
---|
| 613 | power=self._low_extrapolation_power) |
---|
| 614 | self._low_extrapolation_power_fitted = p[0] |
---|
[bdd162f] | 615 | |
---|
| 616 | # Distribution starting point |
---|
[2e94cbde] | 617 | self._low_q_limit = Q_MINIMUM |
---|
[3bb37ef] | 618 | if Q_MINIMUM >= qmin: |
---|
[2e94cbde] | 619 | self._low_q_limit = qmin/10 |
---|
[82703a1] | 620 | |
---|
[cbaa2f4] | 621 | data = self._get_extrapolated_data(\ |
---|
| 622 | model=self._low_extrapolation_function, |
---|
| 623 | npts=INTEGRATION_NSTEPS, |
---|
| 624 | q_start=self._low_q_limit, q_end=qmin) |
---|
[bdd162f] | 625 | |
---|
| 626 | # Systematic error |
---|
| 627 | # If we have smearing, the shape of the I(q) distribution at low Q will |
---|
| 628 | # may not be a Guinier or simple power law. The following is a conservative |
---|
| 629 | # estimation for the systematic error. |
---|
[cbaa2f4] | 630 | err = qmin*qmin*math.fabs((qmin-self._low_q_limit)*\ |
---|
| 631 | (data.y[0] - data.y[INTEGRATION_NSTEPS-1])) |
---|
[bdd162f] | 632 | return self._get_qstar(data), self._get_qstar_uncertainty(data)+err |
---|
| 633 | |
---|
| 634 | def get_qstar_high(self): |
---|
[75047cf] | 635 | """ |
---|
[a45622a] | 636 | Compute the invariant for extrapolated data at high q range. |
---|
| 637 | |
---|
| 638 | Implementation: |
---|
| 639 | data = self._get_extra_data_high() |
---|
| 640 | return self._get_qstar() |
---|
[75047cf] | 641 | |
---|
[a45622a] | 642 | :return q_star: the invariant for data extrapolated at high q. |
---|
[75047cf] | 643 | """ |
---|
[82703a1] | 644 | # Data boundaries for fitting |
---|
[ef9ed58] | 645 | x_len = len(self._data.x) - 1 |
---|
[82703a1] | 646 | qmin = self._data.x[x_len - (self._high_extrapolation_npts - 1)] |
---|
[ef9ed58] | 647 | qmax = self._data.x[x_len] |
---|
| 648 | |
---|
[59a41066] | 649 | # fit the data with a model to get the appropriate parameters |
---|
[c4f52e3] | 650 | p, dp = self._fit(model=self._high_extrapolation_function, |
---|
| 651 | qmin=qmin, |
---|
| 652 | qmax=qmax, |
---|
| 653 | power=self._high_extrapolation_power) |
---|
| 654 | self._high_extrapolation_power_fitted = p[0] |
---|
[aafa962] | 655 | |
---|
[ef9ed58] | 656 | #create new Data1D to compute the invariant |
---|
[cbaa2f4] | 657 | data = self._get_extrapolated_data(\ |
---|
| 658 | model=self._high_extrapolation_function, |
---|
[bdd162f] | 659 | npts=INTEGRATION_NSTEPS, |
---|
[2e94cbde] | 660 | q_start=qmax, q_end=Q_MAXIMUM) |
---|
[76c1727] | 661 | |
---|
[bdd162f] | 662 | return self._get_qstar(data), self._get_qstar_uncertainty(data) |
---|
[76c1727] | 663 | |
---|
[c75a8ed] | 664 | def get_extra_data_low(self, npts_in=None, q_start=None, npts=20): |
---|
[2e94cbde] | 665 | """ |
---|
[a45622a] | 666 | Returns the extrapolated data used for the loew-Q invariant calculation. |
---|
| 667 | By default, the distribution will cover the data points used for the |
---|
| 668 | extrapolation. The number of overlap points is a parameter (npts_in). |
---|
| 669 | By default, the maximum q-value of the distribution will be |
---|
| 670 | the minimum q-value used when extrapolating for the purpose of the |
---|
| 671 | invariant calculation. |
---|
| 672 | |
---|
[cbaa2f4] | 673 | :param npts_in: number of data points for which |
---|
| 674 | the extrapolated data overlap |
---|
[a45622a] | 675 | :param q_start: is the minimum value to uses for extrapolated data |
---|
| 676 | :param npts: the number of points in the extrapolated distribution |
---|
[1702180] | 677 | |
---|
[76c1727] | 678 | """ |
---|
[2e94cbde] | 679 | # Get extrapolation range |
---|
| 680 | if q_start is None: |
---|
| 681 | q_start = self._low_q_limit |
---|
[bdd162f] | 682 | |
---|
[2e94cbde] | 683 | if npts_in is None: |
---|
[76c1727] | 684 | npts_in = self._low_extrapolation_npts |
---|
[2e94cbde] | 685 | q_end = self._data.x[max(0, npts_in-1)] |
---|
[76c1727] | 686 | |
---|
[2e94cbde] | 687 | if q_start >= q_end: |
---|
| 688 | return numpy.zeros(0), numpy.zeros(0) |
---|
| 689 | |
---|
[cbaa2f4] | 690 | return self._get_extrapolated_data(\ |
---|
| 691 | model=self._low_extrapolation_function, |
---|
[c75a8ed] | 692 | npts=npts, |
---|
[2e94cbde] | 693 | q_start=q_start, q_end=q_end) |
---|
[76c1727] | 694 | |
---|
[2e94cbde] | 695 | def get_extra_data_high(self, npts_in=None, q_end=Q_MAXIMUM, npts=20): |
---|
| 696 | """ |
---|
[a45622a] | 697 | Returns the extrapolated data used for the high-Q invariant calculation. |
---|
| 698 | By default, the distribution will cover the data points used for the |
---|
| 699 | extrapolation. The number of overlap points is a parameter (npts_in). |
---|
| 700 | By default, the maximum q-value of the distribution will be Q_MAXIMUM, |
---|
| 701 | the maximum q-value used when extrapolating for the purpose of the |
---|
| 702 | invariant calculation. |
---|
| 703 | |
---|
[cbaa2f4] | 704 | :param npts_in: number of data points for which the |
---|
| 705 | extrapolated data overlap |
---|
[a45622a] | 706 | :param q_end: is the maximum value to uses for extrapolated data |
---|
| 707 | :param npts: the number of points in the extrapolated distribution |
---|
[76c1727] | 708 | """ |
---|
[2e94cbde] | 709 | # Get extrapolation range |
---|
| 710 | if npts_in is None: |
---|
[76c1727] | 711 | npts_in = self._high_extrapolation_npts |
---|
[c75a8ed] | 712 | _npts = len(self._data.x) |
---|
| 713 | q_start = self._data.x[min(_npts, _npts-npts_in)] |
---|
[76c1727] | 714 | |
---|
[2e94cbde] | 715 | if q_start >= q_end: |
---|
| 716 | return numpy.zeros(0), numpy.zeros(0) |
---|
| 717 | |
---|
[cbaa2f4] | 718 | return self._get_extrapolated_data(\ |
---|
| 719 | model=self._high_extrapolation_function, |
---|
[2e94cbde] | 720 | npts=npts, |
---|
| 721 | q_start=q_start, q_end=q_end) |
---|
[4e80ae0] | 722 | |
---|
| 723 | def set_extrapolation(self, range, npts=4, function=None, power=None): |
---|
| 724 | """ |
---|
[a45622a] | 725 | Set the extrapolation parameters for the high or low Q-range. |
---|
| 726 | Note that this does not turn extrapolation on or off. |
---|
| 727 | |
---|
| 728 | :param range: a keyword set the type of extrapolation . type string |
---|
[cbaa2f4] | 729 | :param npts: the numbers of q points of data to consider |
---|
| 730 | for extrapolation |
---|
| 731 | :param function: a keyword to select the function to use |
---|
| 732 | for extrapolation. |
---|
[a45622a] | 733 | of type string. |
---|
| 734 | :param power: an power to apply power_low function |
---|
[4e80ae0] | 735 | |
---|
| 736 | """ |
---|
| 737 | range = range.lower() |
---|
| 738 | if range not in ['high', 'low']: |
---|
| 739 | raise ValueError, "Extrapolation range should be 'high' or 'low'" |
---|
| 740 | function = function.lower() |
---|
| 741 | if function not in ['power_law', 'guinier']: |
---|
[cbaa2f4] | 742 | msg = "Extrapolation function should be 'guinier' or 'power_law'" |
---|
| 743 | raise ValueError, msg |
---|
[4e80ae0] | 744 | |
---|
| 745 | if range == 'high': |
---|
| 746 | if function != 'power_law': |
---|
[cbaa2f4] | 747 | msg = "Extrapolation only allows a power law at high Q" |
---|
| 748 | raise ValueError, msg |
---|
[4e80ae0] | 749 | self._high_extrapolation_npts = npts |
---|
| 750 | self._high_extrapolation_power = power |
---|
[90e5ca1] | 751 | self._high_extrapolation_power_fitted = power |
---|
[4e80ae0] | 752 | else: |
---|
| 753 | if function == 'power_law': |
---|
[59a41066] | 754 | self._low_extrapolation_function = PowerLaw() |
---|
[4e80ae0] | 755 | else: |
---|
[59a41066] | 756 | self._low_extrapolation_function = Guinier() |
---|
[4e80ae0] | 757 | self._low_extrapolation_npts = npts |
---|
| 758 | self._low_extrapolation_power = power |
---|
[90e5ca1] | 759 | self._low_extrapolation_power_fitted = power |
---|
[4e80ae0] | 760 | |
---|
| 761 | def get_qstar(self, extrapolation=None): |
---|
| 762 | """ |
---|
[a45622a] | 763 | Compute the invariant of the local copy of data. |
---|
| 764 | |
---|
| 765 | :param extrapolation: string to apply optional extrapolation |
---|
[4e80ae0] | 766 | |
---|
[a45622a] | 767 | :return q_star: invariant of the data within data's q range |
---|
| 768 | |
---|
[cbaa2f4] | 769 | :warning: When using setting data to Data1D , |
---|
| 770 | the user is responsible of |
---|
| 771 | checking that the scale and the background are |
---|
| 772 | properly apply to the data |
---|
[a45622a] | 773 | |
---|
[4e80ae0] | 774 | """ |
---|
[bdd162f] | 775 | self._qstar = self._get_qstar(self._data) |
---|
| 776 | self._qstar_err = self._get_qstar_uncertainty(self._data) |
---|
[4e80ae0] | 777 | |
---|
| 778 | if extrapolation is None: |
---|
| 779 | return self._qstar |
---|
[bdd162f] | 780 | |
---|
| 781 | # Compute invariant plus invariant of extrapolated data |
---|
[4e80ae0] | 782 | extrapolation = extrapolation.lower() |
---|
| 783 | if extrapolation == "low": |
---|
[bdd162f] | 784 | qs_low, dqs_low = self.get_qstar_low() |
---|
| 785 | qs_hi, dqs_hi = 0, 0 |
---|
| 786 | |
---|
[4e80ae0] | 787 | elif extrapolation == "high": |
---|
[bdd162f] | 788 | qs_low, dqs_low = 0, 0 |
---|
| 789 | qs_hi, dqs_hi = self.get_qstar_high() |
---|
| 790 | |
---|
[4e80ae0] | 791 | elif extrapolation == "both": |
---|
[bdd162f] | 792 | qs_low, dqs_low = self.get_qstar_low() |
---|
| 793 | qs_hi, dqs_hi = self.get_qstar_high() |
---|
| 794 | |
---|
| 795 | self._qstar += qs_low + qs_hi |
---|
| 796 | self._qstar_err = math.sqrt(self._qstar_err*self._qstar_err \ |
---|
| 797 | + dqs_low*dqs_low + dqs_hi*dqs_hi) |
---|
| 798 | |
---|
| 799 | return self._qstar |
---|
[4e80ae0] | 800 | |
---|
[bdd162f] | 801 | def get_surface(self, contrast, porod_const, extrapolation=None): |
---|
[4e80ae0] | 802 | """ |
---|
[a45622a] | 803 | Compute the specific surface from the data. |
---|
| 804 | |
---|
| 805 | Implementation:: |
---|
| 806 | |
---|
| 807 | V = self.get_volume_fraction(contrast, extrapolation) |
---|
| 808 | |
---|
| 809 | Compute the surface given by: |
---|
| 810 | surface = (2*pi *V(1- V)*porod_const)/ q_star |
---|
| 811 | |
---|
| 812 | :param contrast: contrast value to compute the volume |
---|
| 813 | :param porod_const: Porod constant to compute the surface |
---|
| 814 | :param extrapolation: string to apply optional extrapolation |
---|
[4e80ae0] | 815 | |
---|
[a45622a] | 816 | :return: specific surface |
---|
[4e80ae0] | 817 | """ |
---|
| 818 | # Compute the volume |
---|
[bdd162f] | 819 | volume = self.get_volume_fraction(contrast, extrapolation) |
---|
[cbaa2f4] | 820 | return 2 * math.pi * volume *(1 - volume) * \ |
---|
| 821 | float(porod_const)/self._qstar |
---|
[4e80ae0] | 822 | |
---|
[bdd162f] | 823 | def get_volume_fraction(self, contrast, extrapolation=None): |
---|
[4e80ae0] | 824 | """ |
---|
[a45622a] | 825 | Compute volume fraction is deduced as follow: :: |
---|
| 826 | |
---|
[4e80ae0] | 827 | q_star = 2*(pi*contrast)**2* volume( 1- volume) |
---|
| 828 | for k = 10^(-8)*q_star/(2*(pi*|contrast|)**2) |
---|
| 829 | we get 2 values of volume: |
---|
| 830 | with 1 - 4 * k >= 0 |
---|
| 831 | volume1 = (1- sqrt(1- 4*k))/2 |
---|
| 832 | volume2 = (1+ sqrt(1- 4*k))/2 |
---|
| 833 | |
---|
| 834 | q_star: the invariant value included extrapolation is applied |
---|
| 835 | unit 1/A^(3)*1/cm |
---|
| 836 | q_star = self.get_qstar() |
---|
| 837 | |
---|
[bdd162f] | 838 | the result returned will be 0 <= volume <= 1 |
---|
[a45622a] | 839 | |
---|
| 840 | :param contrast: contrast value provides by the user of type float. |
---|
| 841 | contrast unit is 1/A^(2)= 10^(16)cm^(2) |
---|
| 842 | :param extrapolation: string to apply optional extrapolation |
---|
| 843 | |
---|
| 844 | :return: volume fraction |
---|
| 845 | |
---|
| 846 | :note: volume fraction must have no unit |
---|
[4e80ae0] | 847 | """ |
---|
[bdd162f] | 848 | if contrast <= 0: |
---|
| 849 | raise ValueError, "The contrast parameter must be greater than zero" |
---|
[4e80ae0] | 850 | |
---|
[bdd162f] | 851 | # Make sure Q star is up to date |
---|
| 852 | self.get_qstar(extrapolation) |
---|
[4e80ae0] | 853 | |
---|
[bdd162f] | 854 | if self._qstar <= 0: |
---|
[cbaa2f4] | 855 | msg = "Invalid invariant: Invariant Q* must be greater than zero" |
---|
| 856 | raise RuntimeError, msg |
---|
[4e80ae0] | 857 | |
---|
| 858 | # Compute intermediate constant |
---|
| 859 | k = 1.e-8 * self._qstar/(2 * (math.pi * math.fabs(float(contrast)))**2) |
---|
[bdd162f] | 860 | # Check discriminant value |
---|
[4e80ae0] | 861 | discrim = 1 - 4 * k |
---|
| 862 | |
---|
| 863 | # Compute volume fraction |
---|
| 864 | if discrim < 0: |
---|
[cbaa2f4] | 865 | msg = "Could not compute the volume fraction: negative discriminant" |
---|
| 866 | raise RuntimeError, msg |
---|
[4e80ae0] | 867 | elif discrim == 0: |
---|
| 868 | return 1/2 |
---|
| 869 | else: |
---|
| 870 | volume1 = 0.5 * (1 - math.sqrt(discrim)) |
---|
| 871 | volume2 = 0.5 * (1 + math.sqrt(discrim)) |
---|
| 872 | |
---|
| 873 | if 0 <= volume1 and volume1 <= 1: |
---|
| 874 | return volume1 |
---|
| 875 | elif 0 <= volume2 and volume2 <= 1: |
---|
| 876 | return volume2 |
---|
[cbaa2f4] | 877 | msg = "Could not compute the volume fraction: inconsistent results" |
---|
| 878 | raise RuntimeError, msg |
---|
[ef9ed58] | 879 | |
---|
| 880 | def get_qstar_with_error(self, extrapolation=None): |
---|
[75047cf] | 881 | """ |
---|
[a45622a] | 882 | Compute the invariant uncertainty. |
---|
| 883 | This uncertainty computation depends on whether or not the data is |
---|
| 884 | smeared. |
---|
| 885 | |
---|
| 886 | :param extrapolation: string to apply optional extrapolation |
---|
| 887 | |
---|
| 888 | :return: invariant, the invariant uncertainty |
---|
[bdd162f] | 889 | """ |
---|
| 890 | self.get_qstar(extrapolation) |
---|
[ef9ed58] | 891 | return self._qstar, self._qstar_err |
---|
| 892 | |
---|
[bdd162f] | 893 | def get_volume_fraction_with_error(self, contrast, extrapolation=None): |
---|
[75047cf] | 894 | """ |
---|
[a45622a] | 895 | Compute uncertainty on volume value as well as the volume fraction |
---|
| 896 | This uncertainty is given by the following equation: :: |
---|
| 897 | |
---|
[75047cf] | 898 | dV = 0.5 * (4*k* dq_star) /(2* math.sqrt(1-k* q_star)) |
---|
| 899 | |
---|
[437a9f0] | 900 | for k = 10^(-8)*q_star/(2*(pi*|contrast|)**2) |
---|
[2cce133] | 901 | |
---|
[75047cf] | 902 | q_star: the invariant value including extrapolated value if existing |
---|
| 903 | dq_star: the invariant uncertainty |
---|
| 904 | dV: the volume uncertainty |
---|
[a45622a] | 905 | |
---|
| 906 | The uncertainty will be set to -1 if it can't be computed. |
---|
| 907 | |
---|
| 908 | :param contrast: contrast value |
---|
| 909 | :param extrapolation: string to apply optional extrapolation |
---|
| 910 | |
---|
| 911 | :return: V, dV = volume fraction, error on volume fraction |
---|
[75047cf] | 912 | """ |
---|
[bdd162f] | 913 | volume = self.get_volume_fraction(contrast, extrapolation) |
---|
[75047cf] | 914 | |
---|
[bdd162f] | 915 | # Compute error |
---|
[437a9f0] | 916 | k = 1.e-8 * self._qstar /(2 * (math.pi* math.fabs(float(contrast)))**2) |
---|
[bdd162f] | 917 | # Check value inside the sqrt function |
---|
[ef9ed58] | 918 | value = 1 - k * self._qstar |
---|
[bad9ae2] | 919 | if (value) <= 0: |
---|
[bdd162f] | 920 | uncertainty = -1 |
---|
[ef9ed58] | 921 | # Compute uncertainty |
---|
[cbaa2f4] | 922 | uncertainty = math.fabs((0.5 * 4 * k * \ |
---|
| 923 | self._qstar_err)/(2 * math.sqrt(1 - k * self._qstar))) |
---|
[ef9ed58] | 924 | |
---|
[bdd162f] | 925 | return volume, uncertainty |
---|
[ef9ed58] | 926 | |
---|
[bdd162f] | 927 | def get_surface_with_error(self, contrast, porod_const, extrapolation=None): |
---|
[75047cf] | 928 | """ |
---|
[a45622a] | 929 | Compute uncertainty of the surface value as well as the surface value. |
---|
| 930 | The uncertainty is given as follow: :: |
---|
| 931 | |
---|
[75047cf] | 932 | dS = porod_const *2*pi[( dV -2*V*dV)/q_star |
---|
| 933 | + dq_star(v-v**2) |
---|
| 934 | |
---|
[bdd162f] | 935 | q_star: the invariant value |
---|
[75047cf] | 936 | dq_star: the invariant uncertainty |
---|
| 937 | V: the volume fraction value |
---|
| 938 | dV: the volume uncertainty |
---|
[a45622a] | 939 | |
---|
| 940 | :param contrast: contrast value |
---|
| 941 | :param porod_const: porod constant value |
---|
| 942 | :param extrapolation: string to apply optional extrapolation |
---|
| 943 | |
---|
| 944 | :return S, dS: the surface, with its uncertainty |
---|
[75047cf] | 945 | """ |
---|
[bdd162f] | 946 | # We get the volume fraction, with error |
---|
| 947 | # get_volume_fraction_with_error calls get_volume_fraction |
---|
| 948 | # get_volume_fraction calls get_qstar |
---|
| 949 | # which computes Qstar and dQstar |
---|
| 950 | v, dv = self.get_volume_fraction_with_error(contrast, extrapolation) |
---|
| 951 | |
---|
[c75a8ed] | 952 | s = self.get_surface(contrast=contrast, porod_const=porod_const, |
---|
| 953 | extrapolation=extrapolation) |
---|
[ef9ed58] | 954 | ds = porod_const * 2 * math.pi * (( dv - 2 * v * dv)/ self._qstar\ |
---|
| 955 | + self._qstar_err * ( v - v**2)) |
---|
[bdd162f] | 956 | |
---|
[ef9ed58] | 957 | return s, ds |
---|