On Thu, Nov 20, 2008 at 07:58:52AM +0200, Scott Sinclair wrote:
> A Notes section giving an overview of the algorithm has been added to
> the docstring http://docs.scipy.org/numpy/docs/numpy.linalg.linalg.solve/.
Doc goals: We would like each function and class to have docs that
compare favorably
On 11/20/2008 12:58 AM Scott Sinclair apparently wrote:
> A Notes section giving an overview of the algorithm has been added to
> the docstring http://docs.scipy.org/numpy/docs/numpy.linalg.linalg.solve/.
You beat me to it.
(I was awaiting editing privileges,
which I just received.)
Thanks!
Alan
On Thu, Nov 20, 2008 at 07:58:52AM +0200, Scott Sinclair wrote:
> A Notes section giving an overview of the algorithm has been added to
> the docstring http://docs.scipy.org/numpy/docs/numpy.linalg.linalg.solve/.
I thank you very much for doing this, and I reckon many users should be
grateful. Thi
On Wed, Nov 19, 2008 at 10:58 PM, Scott Sinclair wrote:
> 2008/11/20 Charles R Harris <[EMAIL PROTECTED]>:
> >
> > On Wed, Nov 19, 2008 at 3:20 PM, Fabrice Silva <[EMAIL PROTECTED]>
> > wrote:
> >>
> >> Le mercredi 19 novembre 2008 à 14:27 -0500, Alan G Isaac a écrit :
> >> > So my question is no
2008/11/20 Charles R Harris <[EMAIL PROTECTED]>:
>
> On Wed, Nov 19, 2008 at 3:20 PM, Fabrice Silva <[EMAIL PROTECTED]>
> wrote:
>>
>> Le mercredi 19 novembre 2008 à 14:27 -0500, Alan G Isaac a écrit :
>> > So my question is not just what is the algorithm
>> > but also, what is the documentation go
On Wed, Nov 19, 2008 at 3:20 PM, Fabrice Silva <[EMAIL PROTECTED]>wrote:
> Le mercredi 19 novembre 2008 à 14:27 -0500, Alan G Isaac a écrit :
> > So my question is not just what is the algorithm
> > but also, what is the documentation goal?
>
> Concerning the algorithm (only):
> in Joshua answer,
On Wed, Nov 19, 2008 at 02:27:11PM -0500, Alan G Isaac wrote:
> So my question is not just what is the algorithm
> but also, what is the documentation goal?
That's a good question. I feel the documentation should be as precise as
possible, and thus answer this question. Currently it doesn't, but t
Le mercredi 19 novembre 2008 à 14:27 -0500, Alan G Isaac a écrit :
> So my question is not just what is the algorithm
> but also, what is the documentation goal?
Concerning the algorithm (only):
in Joshua answer, you have might have seen that solve is a wrapper to
lapack routines *gesv (z* or d* d
Thanks Charles and Josh, but my question
about the documentation goal remains.
Here is how this came up. I mentioned
to a class that I have using NumPy that
solving Ax=b with an inverse is
computationally wasteful and also has
accuracy problems, and I recommend
using `solve` instead. So the ques
On Wed, Nov 19, 2008 at 8:14 AM, Alan G Isaac <[EMAIL PROTECTED]> wrote:
> If if look at help(np.linalg.solve) I am
> told what it does but not how it does it.
> If I look at
> http://www.scipy.org/doc/numpy_api_docs/numpy.linalg.linalg.html#solve
> there is even less info. I'll guess the
> algor
If you use iPython and use "numpy.linalg.solve??", you can see the
source code of the file numpy/linalg/linalg.py that corresponds to the
solve(a,b) function, not just the docstring:
def solve(a, b):
"""
Solve the equation ``a x = b`` for ``x``.
Parameters
--
a : array
If if look at help(np.linalg.solve) I am
told what it does but not how it does it.
If I look at
http://www.scipy.org/doc/numpy_api_docs/numpy.linalg.linalg.html#solve
there is even less info. I'll guess the
algorithm is Gaussian elimination, but how
would I use the documentation to confirm this?
(
12 matches
Mail list logo
