On Monday, October 3, 2016 at 1:15:09 PM UTC+2, John Cremona wrote:
>
>
> I don't quite understand the problem, since Frac(R)=k(x) anyway. Do
> you only have a problem when x is not in R, since otherwise k[x] is a
> subring of R anyway and the numerator / denominator are then correct
> (thou
On 3 October 2016 at 11:01, Kwankyu wrote:
> Hi,
>
> I want to do linear algebra over a valuation ring (infinite) R of rational
> function field. As R is a PID, I expected the Sage machinery over general
> PID works fine for it. But it does not. The problem is, as I understand it,
> that internall
Hi,
I want to do linear algebra over a valuation ring (infinite) R of rational
function field. As R is a PID, I expected the Sage machinery over general
PID works fine for it. But it does not. The problem is, as I understand it,
that internally Sage assumes an ambient vector space over Frac(R)=
On 02/29/2016 10:19 PM, Emerson Misch wrote:
> I am new to sage and have little knowledge of its computing power and am
> interested in the coding for a few things.
>
> 1) Creating a vector space V over the field of Svalbard (all reals) or C of a
> given dimension n.
sage: VectorSpace(RR,n)
o
I am new to sage and have little knowledge of its computing power and am
interested in the coding for a few things.
1) Creating a vector space V over the field of Svalbard (all reals) or C of a
given dimension n.
2) Finding the dimension and basis of V
3) creating subspaces U and W of V
4) crea
Lately I need to do computations of this sort: for F a field, say, QQ,
given polynomials f, g_1,...,g_k in F[x1,...,xn], where n can be, say,
50, find out whether f belongs to the F-span of g_1,...,g_k.
(and find an expression for f as sum_j a_j g_j, if it exists)
This is of course easy linear alg
I have updated the Linear Algebra Quick Reference card to more closely match
version 4.8 and to catch up on 2.5 years worth of changes. You can find it (and
others) at:
http://wiki.sagemath.org/quickref
Rob
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe
On Mar 14, 2011, at 22:08 , John H Palmieri wrote:
>
> On Monday, March 14, 2011 9:02:48 PM UTC-7, Justin C. Walker wrote:
>>
>> Hi, and Welcome,
>>
>> On Mar 14, 2011, at 20:14 , Ben123 wrote:
>>
>>> Hello. I'm a new user to Sage. I am trying to create a matrix without
>>> knowing the values
On Monday, March 14, 2011 9:02:48 PM UTC-7, Justin C. Walker wrote:
>
> Hi, and Welcome,
>
> On Mar 14, 2011, at 20:14 , Ben123 wrote:
>
> > Hello. I'm a new user to Sage. I am trying to create a matrix without
> > knowing the values when it is initialized. All the examples I see have
> > static
Hi, and Welcome,
On Mar 14, 2011, at 20:14 , Ben123 wrote:
> Hello. I'm a new user to Sage. I am trying to create a matrix without
> knowing the values when it is initialized. All the examples I see have
> static matrices like
> A = matrix(QQ,2,2,[2,1,1,2])
> My goal is to create a 2x2 matrix whi
Hello. I'm a new user to Sage. I am trying to create a matrix without
knowing the values when it is initialized. All the examples I see have
static matrices like
A = matrix(QQ,2,2,[2,1,1,2])
My goal is to create a 2x2 matrix which I can then give values for
later
A[1][1]=5
However, I am told the ve
What is the easiest way to set up a vector of variables?
I have a linear algebra problem ( GF(2) )
and want to manipulate equations.
The matrix sizes are M x M with M = O(100).
The way I currently go about this is too much of a kludge
to even admit to!
Thank you for the great tool and support I
Greetings. I'm brand new to Sage, and am excited to get started.
I've been using Maple recently, namely the 'linalg' and
'LinearAlgebra' packages.
Browsing the Sage Reference Manual, I don't see an analogue for these
packages. For instance, I want to perform a pseudo-inverse operation
to solve
13 matches
Mail list logo
