Thanks Jason!
I see that right_kernel() also works for this.
-- Bill
On Sat, Jun 6, 2009 at 5:41 PM, Jason Grout wrote:
>
> William Cauchois wrote:
>> Hi,
>>
>> I needed to check the null space of the following matrix:
>>
>> [ -2 7 ]
>> [ 0 0 ]
>>
>> So I typed:
>>
>> sage: matrix([[-2, 7]
William Cauchois wrote:
> Hi,
>
> I needed to check the null space of the following matrix:
>
> [ -2 7 ]
> [ 00 ]
>
> So I typed:
>
> sage: matrix([[-2, 7], [0, 0]]).kernel()
>
> And Sage 4.0.rc0 told me that the basis for the resultant vector space
> was [0, 1]. But this does not seem
Hi,
I needed to check the null space of the following matrix:
[ -2 7 ]
[ 00 ]
So I typed:
sage: matrix([[-2, 7], [0, 0]]).kernel()
And Sage 4.0.rc0 told me that the basis for the resultant vector space
was [0, 1]. But this does not seem correct -- [0, 1] does not even
satisfy the equati
I just figured out what were wrong in the last command.
For those who might have a similar question, I put a correct one (that I
obtained by mimicking what Javier showed to me) in the following:
p=20; q=20; r=1; s=2; t=2;
def a(i,j):
for k in [1..t]:
if (r*(k-1)+1 <= i <= r*k) and (s*
evlu...@gmail.com wrote:
> def nystrom(A,g,n,zerodiagonal = false):
> def boundaryMapper(Ga,a,n):
Does anyone know what this is about? I am working on this a little
bit and I got a messy result; I don't know if I 'm heading in the
right direction or not. Googling for "nystrom boundary mapping"
Thank you all for excellent help on the question.
I have another question along this line:
For p=20, q=20, r=1, s=2, t=2, I would like to define matrix
A=[a(i,j)] such that
for k in range(1,t+1), a(i,j)=2 if ((r*(k-1)+1 <= i <= r*k) and (s*(k-1)+1 <= j
<= s*k)), and
all other entries are 3.
I h
This is some sort of incompatibility with that binary and your
computer. I would recommend installing from source, which is not
difficult but might take a while if you have an older machine (2-6
hours, possibly more if you have very limited (say <512 MB) RAM.
http://www.sagemath.org/download-sou
Hi,
On Sat, Jun 6, 2009 at 10:55 PM, Hobus wrote:
>
> Sage 4.0 can be installed on ubuntu 8.04?
>
> I had this error:
> /home/jluxtux/sage-4.0-linux-Ubuntu_9.04-sse2-i686-Linux/local/bin/
> sage-sage: line 198: 7984 Instrucción ilegal sage-ipython "$@" -i
A similar problem has come up befor
Sage 4.0 can be installed on ubuntu 8.04?
I had this error:
/home/jluxtux/sage-4.0-linux-Ubuntu_9.04-sse2-i686-Linux/local/bin/
sage-sage: line 198: 7984 Instrucción ilegal sage-ipython "$@" -i
--~--~-~--~~~---~--~~
To post to this group, send email to sage-s
Hi all
thanks for the answers. Here is simple example. It's in fact
intersection of two
projective curves:
a cuspidal cubic curve y^2*z-x^3=0 and its polar w.r.t. (2:1:1) :
2*y*z + y^2 - 2*3*x^2.
when substituting z=1 i used:
solve([y^2-x^3==0, 2*y +y^2 -2*3*x^2==0], x, y).
The general case wil
Can the original poster provide a (simple) example of the kind of set
of equations he wants to solve? For example, are they polynomials in
several variables, or more exotic? In the case of polynomial
equations it is more likely that (perhaps via Singular) the
multiplicities can be obtained.
Joh
Hi!
On 6 Jun., 05:45, Robert Dodier wrote:
> CVS log claims this bug was fixed recently (between 5.17 & 5.18).
> Here's what I get with Maxima from CVS (5.18+).
>
> ...
Very good! So, ticket #6228 can be closed when the new maxima version
is in Sage.
But I think we should now come back to the
12 matches
Mail list logo
