On Mon, Jan 3, 2011 at 2:46 PM, David Cournapeau wrote:
> Hi,
>
> I finally took the time to clean up my code to speed up prime-size FFT
> (which use a O(N^2) algo in both numpy and scipy). The code is there:
> https://github.com/cournape/numpy/tree/bluestein (most of the code is
> tests, because
After upgrading to numpy 1.5.1 I got caught by some depreciated
features. Given the depreciation policy of numpy, if we want to
support more than two versions of numpy, then we need some conditional
execution.
Does anyone have any compatibility functions?
I haven't looked at it carefully yet, but
I've opened http://projects.scipy.org/numpy/ticket/1713 so this doesn't get
lost.
Ralf
On Thu, Jan 6, 2011 at 12:27 AM, John Hunter wrote:
> johnh@udesktop253:~> gcc --version
> gcc (GCC) 3.4.3 (csl-sol210-3_4-branch+sol_rpath)
> Copyright (C) 2004 Free Software Foundation, Inc.
> This is free
I have used the Savitzky-Golay filter provided by cookbook, but the result
is different from the one given by matlab function sgolayfilt(x,2,15). I
attached the numpy code below:
#! /usr/bin/env python
# -*- coding:utf-8 -*-
import numpy as np
def savitzky_golay(y, window_size, order, deriv=0):
