___
NumPy-Discussion mailing list
NumPy-Discussion@scipy.org
http://mail.scipy.org/mailman/listinfo/numpy-discussion
Hey,
thanks for providing windows binaries, i never was able to build vienna
cl on my own. Big question: is there interoperability between pyopencl
and pyviennacl? I don't want to copy these big arrays around, especially
if they are already on the device.
greetings
Till
__
Hi,
there already a plan to release 1.8? I would like to play around with gufuncs.
greetings
Till
___
NumPy-Discussion mailing list
NumPy-Discussion@scipy.org
http://mail.scipy.org/mailman/listinfo/numpy-discussion
Todd gmail.com> writes:
>
> I have some ideas, but they may not be suitable for GSOC or may just be
terrible ideas, so feel free to reject them:
>
I have also a possible (terrible?) idea in my mind:
Including (maybe optional as blas) faster transcendental functions into numpy.
Something like ht
First, sorry that i didnt search for an old thread, but because i disagree with
conclusion i would at least address my reason:
> I don't like
> np.abs(arr).max()
> because I have to concentrate to much on the braces, especially if arr
> is a calculation
This exactly, adding an abs into an old e
Hello,
i know that the array object is already crowded, but i would like
to see the abs method added, especially doing work on the console.
Considering that many much less used functions are also implemented
as a method, i don't think adding one more would be problematic.
greetings
Till
_
Thanks for hints so far, i am especially searching
for a way to get rid of the t loop. Making a NxMxM
Matrix is quite memory inefficient in my case (N > M).
On way would be just use cython, but i think this problem
common enough to have a solution into scipy.
(Solution of a simple compartment m
Hi group,
is there a faster way to calculate the
matrix exponential for different t's
than this:
def sol_matexp(A, tlist, y0):
w, v = np.linalg.eig(A)
out = np.zeros((tlist.size, y0.size))
for i, t in enumerate(tlist):
sol_t = np.dot(v,np.diag(np.exp(-w*t))).dot(np.linalg.inv
>
> QR without column pivoting is a nice option for
>"safe" problems, but it doesn't
>provide a reliable indication of rank
>reduction. I also don't find pinv useful
>once the rank goes down, since it relies on
> Euclidean distance having relevance in
>parameter space and that is seldom a so
Pierre Raybaut gmail.com> writes:
>
> Hi all,
>
> I'm pleased to announce that the first previews of WinPython for
> Python 3 32bit and 64bit are available (WinPython v3.3.0.0alpha1):
> http://code.google.com/p/winpython/
> This first release based on Python 3 required to migrate the following
Charles R Harris gmail.com> writes:
> Make Tom a member of the numpy organization on github.
> Set up an extension dtypes repository in github.com/numpy
>
>
> Other proposals for the name are welcome.
>
Why not put them into scipy.dtypes?
Till
Hello,
is there weighted version of linalg.lstsq available?
In my case, b is a (N,K) matrix, so i can't use manual scaling of x and b.
greetings
Till
___
NumPy-Discussion mailing list
NumPy-Discussion@scipy.org
http://mail.scipy.org/mailman/listinfo/nu
Doesent Theano does the same, only via GCC compilation?
___
NumPy-Discussion mailing list
NumPy-Discussion@scipy.org
http://mail.scipy.org/mailman/listinfo/numpy-discussion
Hi,
for a description of the problem see here:
http://stackoverflow.com/questions/7820809/understanding-weird-boolean-2d-array-indexing-behavior-in-numpy
I really think, that the current way of handling two boolean indices is
missleading, is there any reason behind that?
greetings
Till
___
Hi,
discovered another small bug. Windows 7 32 bit, Python 2.6.
In [1]: np.__version__
Out[1]: '1.5.1'
In [2]: a=np.zeros((0,2))
In [3]: np.linalg.qr(a)
** On entry to DGEQRF parameter number 4 had an illegal value
--Here python is crashed.
While np.linalg.lstsq doesn't crashs, the error mes
> Do you also have an earlier version of numpy installed? As David says, this
>should raise an error for recent numpy and
>I'm wondering if you are inadvertently
>running an earlier version.Chuck
I only have one python installation and
numpy.__version__ shows 1.6b.
I could reinstall numpy
> Hm, this is a bit weird. The line x = np.zeros... should fail (you
> most likely do not have 512 Gb Ram available on your machine :) ).
> Maybe a check is wrong due to some wrong configuration on windows. Are
> you on windows 32 or 64 bits ?
>
I took the outer product of two (512,512)-matric
Hello,
due a mistake i found the following bug:
import numpy as np
x=np.zeros((262144, 262144))
print x.shape
print x
The last line crashes the python interpreter without any feedback.
Windows 7, Python 2.6.5, Numpy 1.6b2
___
NumPy-Discussion mailing
>
> Moreover, np.linalg.norm is slow compare to blas.
>
> Is there a way/plan to fix it?
>
> Xavier
>
Have a look at:
http://fseoane.net/blog/2011/computing-the-vector-norm/
greetings
Till
___
NumPy-Discussion mailing list
NumPy-Discussion@scipy
Alex Ter-Sarkissov gmail.com> writes:
>
> hi, the question is probably very silly, but can't get my head around itSay
> I have an NxM numerical array. What I want is to obtain the row and
> column number of the smallest value(kinda like find command in Matlab).
> I use something like where(min(
20 matches
Mail list logo
