Hi,
i'm using sage in a course and we came up with some problems
concerning the absolute value and the solve-function.
We started to solving the equation abs(abs(x-2)-1)==4 for real x.
But even easier equations makes problems:
solve(abs(x)==5,x)
Is there a reason why sage isn't able to give a us
]) * matrix(2,[1.5,1.75,-1.5,-1.75]) )
1
And even more serious: multiplying with another rank one matrix:
sage: rank( matrix(2,2,[1,0,1,0]) * matrix(2,[1.5,1.75,-1.5,-1.75]) )
2
I think this is something that should be fixed.
-vgermrk-
--
To post to this group, send an email to sage-devel
It's now #4746
(http://trac.sagemath.org/sage_trac/ticket/4746)
-MRK-
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http:/
There's something really buggy in the "srange"-function.
One can produce almost every (wrong) behavior concerning the endpoint
of the returned list. Here are some examples:
sage: srange(0.5,1.1,0.1,include_endpoint=False)
[0.500,
0.600,
0.700,
0.800
I wrote a patch, which fixes the issue (#2232) and adds a padto-
parameter (as suggested).
Feel free to review :-)
http://trac.sagemath.org/sage_trac/ticket/2232
-vgermrk-
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To
uestion:
Should "0.digits(base=10)" return "[]" or "[0]" (which i prefer, but
i'm here to get your opinions)
Clearly i can just fix my first problem
("0.digits(16,'0123456789abcdef')") and let "0.digits(base=10)" as it
is, but i thi
vince everybody (on IRC), let's discuss here
about it.
So what do you think?
-vgermrk-
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit
On 2 Mrz., 04:17, "Joel B. Mohler" <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I'd like discussion
> on:http://trac.sagemath.org/sage_trac/ticket/2232http://trac.sagemath.org/sage_trac/ticket/2170
> I made comments in both of those last tickets. I think the first is invalid
I don't think so! (Ok, i re
The build fails on my notebook (Intel(R) Pentium(R) M processor
1400MHz), Ubuntu 7.10 (2.6.22-14-generic).
I compiled older versions of sage a few times before on this machine,
but this time i get errors.
Thanks in advance for any help.
The full install.log is at
http://homepage.rub.de/michael.
Let me be the first of many ;-) to say that's maybe more efficient to
use a temporary variable for the padding:
def partition(v,n,pad=0):
t=(v+[pad]*(n-len(v)%n))
return [t[i:i+n] for i in range(0,len(v),n)]
-vgermrk-
On 24 Jan., 09:46, vgermrk <[EMAIL PROTECTED]> wrote:
Let me be the first of many (i like this game :-) to give you
(hopefully) the final solution:
def partition(v,n,pad=0):
return [(v+[pad]*(n-len(v)%n))[i:i+n] for i in range(0,len(v),n)]
-vgermrk-
On 24 Jan., 01:34, Jason Grout <[EMAIL PROTECTED]> wrote:
> [EMAIL PROTECT
Let me be the first of many (i like this game :-) to give you
(hopefully) the final solution:
sage: def partition(v,n,pad=0):
...return [(v+[pad]*(n-len(v)%n))[i:i+n] for i in
range(0,len(v),n)]
-vgermrk-
On 24 Jan., 01:34, Jason Grout <[EMAIL PROTECTED]> wrote:
> [EMAIL
On 9 Jan., 08:25, "Mike Hansen" <[EMAIL PROTECTED]> wrote:
> It was my impression that he didn't want a matrix with matrix entries,
> but instead wanted the matrix whose entries were given by the entries
> of the submatrices.
>
> --Mike
That's right. I should make myself more clearer next time.
-
Is there a way to construct block matrices in SAGE?
Not just the "block_sum", "augment" and "stack" functions.
As an example, let A, B, C, D be matrices and i want to construct a
matrix like E=[[A,B],[C,D]]
Such a feature
14 matches
Mail list logo
