MaplePrimes Posts

MaplePrimes Posts are for sharing your experiences, techniques and opinions about Maple, MapleSim and related products, as well as general interests in math and computing.

Latest Post
  • Latest Posts Feed
  • I want to call a GSL function, which writes data to a pointer to be provided
    (Regular Spherical Bessel Functions, array version) it has prototype
    
      int gsl_sf_bessel_jl_steed_array (int lmax, double x, double * jl_x_array)
    
    so the 'array' is a pointer and no specific length (though only lmax + 1 of
    the space is used, I think).
    
    I tried the below, but the actual call results in a crash:
    
      arrB_GSL := define_external(
        'gsl_sf_bessel_jl_steed_array',
       ...

    I wrote a simple worksheet which allows one to explore the results of iterated applications of the perfect (out) shuffle.

     

     

    <a href='http://mapleoracles.maplesoft.com:8080/maplenet/primes/worksheet/9973_shuffle.mw'>View 9973_shuffle.mw on MapleNet</a> or <a href='http://www.mapleprimes.com/files/9973_shuffle.mw'>Download 9973_shuffle.mw</a><br/><a href='http://www.mapleprimes.com/viewfile/3140'>View file details</a>

    I tried to get the inverse of a 36 by 36 square Matrix, but some time after the evaluation O got the following message: Kernel connection has been lost. The kernel returned the following error message: Execution stopped: Memory allocation failed. Please see >alloc for more detail. You should save the worksheet and restart Maple. Executing commands in Maple requires a connection to the Maple kernel. So what is the problem here. P.S. These are the input of the Matrix > C := Matrix(36, 36); B := Vector(36);
    Learn how to evaluate Double Integrals over General Regions that are not rectangles. The example in the attached worksheet graphs the region's bounding functions. It then articulates two methods for forming and evaluating an iterated double integral to find the area of the region. Watch the Double Integrals over General Regions - Video Tutorial (Ctrl + click) to

    I have been trying to understand Maple's evaluation rules for arguments or parameters as they are passed through procedures, but I am getting confused. Here is an example:

    p1 := proc( y )  print( y, 'y', eval(y,1), eval(y,2) ) :  p2( y ) :  end proc :
    p2 := proc( z )  print( z, 'z', eval(z,1), eval(z,2) ) :  end proc :

    x := ''''5'''' :
    print( x, 'x', eval(x,1), eval(x,2) ) :

    p1( x ) :

    In a previous post I described how to call OpenMaple from a C# application (see: Using OpenMaple with C#) Now, I'd like to tackle the reverse problem: how do I call a C# .dll from within Maple? The way to do this involves using Component Object Model (COM) interoperability in the Microsoft .NET Framework. Because Maple's kernel is written in an "unmanaged" language, a wrapper is needed in order to bridge to your managed C# code. This article will outline the steps needed to create this bridge and get Maple talking to C#.

    One of the great parts of my job is getting to meet all sorts of incredible people from all over the world. One of these, a math professor, is very close by to us, both geographically and professionally. Professor Jack Weiner is one of the most popular educators at the nearby University of Guelph. He is passionate about his work and it shows: he has won numerous awards, including the award for most "Popular Prof" in a national annual survey of Canadian Universities, for eight out of the last nine years.

    Some years ago, before the advent of the Statistics package, a colleague asked for a fast way to generate thousands of normally distributed random numbers in Maple. The suggestion that worked quickest and most easily (using existing, simple Maple Library routines) was to generate random deviates using the usual formula associated with the distribution. But the key was to replace the scalar values (representing the uniformly distributed input) with a whole Matrix of input values....

      hi,

      suppose i have an ode system:  ip(t)+Cp*(diff(vp(t), t)) = 0, Lm*(diff(im(t), t)) = vs(t), Lp*(diff(ip(t), t))+vs(t) = vp(t), ip(t) = im(t)+Cs*(diff(vs(t), t)), im(0) = Ip1, ip(0) = Ip1, vs(0) = 0, vp(0) = 0

    Try to generate a random matrix modulo m using, say, examples from the ?LinearAlgebra,Modular,Random help page.

    I wanted to see how difficult it would be to use the OpenMaple API from a C# program.  It turns out that it is pretty easy to access C .dlls from C#.  I was able to reproduce a commandline equivalent (minus the command history and editing features). 

    The source code can be found here: openmaple.cs

    I have installed maple12 on a 32-bit computer and now realized that it is too weak. I would like to reinstall it on a much more powerfull 64-bit computer.

    I already activated maple12 for that 32-bit computer.

    How can I do that?

    Thanks for any help.

    F.

    Studying the integral bug discussed in Axel Vogt's blog, I met the following,

    residue(arctan(z)^2/(1+z^2),z=I);
    
                                     1/2      1/2 2
                                    2    (z I)
                           1/2 I ln(-------------)
                                          2
    

    Not talking whether the residue has sense in this case, or not, having z in the answer is very wrong.

    Alec

    I was recently forwarded a link to this Snopes article.

    According to the urban legend described therein, text is still readable if all the letters in a word apart from the first and last are randomized. I quickly threw together a Maple worksheet, primarily using its flexible string manipulation tools.

      restart; Digits:=14;     # using Maple 12.02
      J:=Int(arctan(z)^2/(1+4*z^2),z=0..infinity);


      evalf(J);
                               0.40325004753375

      value(J); evalf(%); Re(%);

                    ...
    First 167 168 169 170 171 172 173 Last Page 169 of 297