Sounds good


On Tue, Feb 18, 2014 at 12:58 PM, Demian Wassermann <
notifications@github.com> wrote:

> In dipy/reconst/shore.py:
>
> >
> > -        for n in range(int(self.radial_order / 2) + 1):
> > -            signal_0 += coef[n] * genlaguerre(n, 0.5)(0) * \
> > -                ((factorial(n)) / (2 * np.pi * (self.zeta ** 1.5) * gamma(n + 1.5))) ** 0.5
> > +            for n in range(int(self.radial_order / 2) + 1):
> > +                signal_0 += (
> > +                    coef[n] * (genlaguerre(n, 0.5)(0) * (
> > +                        (factorial(n)) / (2 * np.pi * (self.zeta ** 1.5) * gamma(n + 1.5))
> > +                    ) ** 0.5)
> > +                )
> > +
> > +            coef = coef / signal_0
> > +        else:
> > +            data = data / data[self.gtab.b0s_mask].mean()
> > +
> > +            if cvxopt is not None:  # If cvxopt is not available use scipy (~100 times slower)
>
> The other option was using sqlsq from scipy, the only method that accepts
> equality constraints. However, it was so painfully slow that it became
> unusable. Why don't we pass it without the option and then work on a PR to
> add it?
>
> —
> Reply to this email directly or view it on GitHub<https://github.com/nipy/dipy/pull/324/files#r9841368>
> .
>