On 06/11/2013 09:44 PM, robin hankin wrote:
> OK thanks for this, bug reported [at least, I think it is. I
> couldn't see it on trac].
>
> Now what about this:
>
>
> sage: solve(sin(x) + cos(x) == cos(2*x),x,to_poly_solve=True)
> [x == 2*pi*z264, x == 2*pi*z268 + 1/6004799503160661*I - 355/4
On 06/12/2013 11:04 AM, leif wrote:
> chexmix wrote:
>> I ran a script session to capture the build output.
>
> P.S.:
>
> You don't have to do that.
>
> There's $SAGE_ROOT/logs/install.log (cumulative, usually mostly
> unreadable when 'make' is run with multiple jobs), and
> $SAGE_ROOT/logs/pkgs
> On Monday, June 3, 2013 7:12:34 PM UTC-5, Sam math wrote:
>
> I have a multivariate polynomial and want to keep only up to a
> certain degree. I already know how to do this for the univariate case.
>
> For 1 variable, I'd do:
>
> R. = PolynomialRing(QQ)
>
> f = x^4 + x^2 +
On 04/10/2013 11:00 AM, RRogers wrote:
> The taylor series expansion of exp(x^2.3) is giving x^(fractions) expansion.
> I would have thought the exponents would be integer. How do I force this
> behavior?
>
The problem isn't with sage. It is with Mathematics. There is no
Taylor series (wit
On 03/27/2013 08:03 PM, Jotace wrote:
> Hi all,
>
> I'm teaching vector calculus, and I would like to show the meaning of
> the curl to my students. So here is what I want to do:
>
> 1. Plot a 2d-vector field F = (P,Q) (I know ho to do this)
> 2. Compute the k-component of this field (o.k)
> 3. P
wrote:
I'm curious to see this output. Can you send it ?
2013/1/24 Stephen Montgomery-Smith mailto:step...@missouri.edu>>
On 01/24/13 08:57, Christophe BAL wrote:
Hello,
I would like, if it is possible, to calculate the formal power
of one
matrix ?
On 01/24/13 08:57, Christophe BAL wrote:
Hello,
I would like, if it is possible, to calculate the formal power of one
matrix ?
My attempt is after but it doesn't work... :-(
Christophe
==
var('n')
assume(n, 'integer')
E = matrix([
[0 , 1 , 0 , 0 , 0 ],
On 11/26/12 13:19, Dan Drake wrote:
On Mon, 26 Nov 2012 at 10:10AM -0800, ijt wrote:
I was wondering if there is any way to make sage produce an output
that I can directly use in java code? I am using sage to compute
gradients and hessians of multidim. functions which become quite large
and repl
On 07/02/2012 03:17 PM, Stephen Montgomery-Smith wrote:
I have a need to multiply polynomials of large degree (like degree
2000). The coefficients are non-negative real numbers, whose size
varies a lot.
Right now I am doing it using C++ code, and using the FFT. Because the
size of the
I have a need to multiply polynomials of large degree (like degree
2000). The coefficients are non-negative real numbers, whose size
varies a lot.
Right now I am doing it using C++ code, and using the FFT. Because the
size of the coefficients varies considerably, I have to use high
precisio
10 matches
Mail list logo
