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
  • Maple 9.5 can not be installed on my Suse 10.1 System. Invoking the command ./installMapleLinuxSU leads to the following errors: Preparing to install... Extracting the JRE from the installer archive... Unpacking the JRE... Extracting the installation resources from the installer archive... Configuring the installer for this system's environment... awk: error while loading shared libraries: libdl.so.2: cannot open shared object file: No such file or directory dirname: error while loading shared libraries: libc.so.6: cannot open shared object file: No such file or directory /bin/ls: error while loading shared libraries: librt.so.1: cannot open shared object file: No such file or directory
    What is Way to improve matrix calculation speed in Maple session? 1 LinearAlgebra Solve in Maple session 2 Maple Comand Line mode 3 OpenMaple technology without big resourse of interface. 4 Matlab Connection by with(Matlab); 5 What quality of dual chanel calculation Do you know any information about it? BEST THANKS...
    handtotal:=proc(hand::list) local total; global Cardvalues; total := 0; total := sum('Cardvalues[hand[k]]', 'k' = 1..nops(hand)); if(is_an_ace(hand)) then (unable to parse)if(total + 10
    I've been learning Maple 9.5 for a week now. There are many data types, and they each have their differences in functionality. I came across an article that mentioned that lists and sets make copies of the data for each manipulation, therefore aren't the best choices with that in mind. My questions is essentially: What are the subtleties of the different data types in speed and memory etc...? Which seem to work better is which situations? considering that we all want our code to be done now and take up no memeory :>) thanks James
    This book page describes and compares several methods for sorting lists of names. It revisits using attributes for rapid sorting, with attention to their global effect on strings. It demonstrates the use of the lexorder[n] option to sort and it illustrates the use of convert/local.
    In this episode Tom Lee sits down with John McPhee the inventor of Dynaflex Pro, in his office at the University of Waterloo to discuss dynamic models of physical systems, difficulties one might encounter when commercializing a product, and his work on modeling the piano hammer action. Paul Goossens joins us via telephone from the American Control Conference to talk about DynaFlexPro and other engineering products; and we bring you an interesting selection of news and mailbag items.

    Maplesoft has just announced a public beta for a new product called the Maple Toolbox for MATLAB®. In many ways, it's a more advanced version of the Symbolic Math Toolbox produced by The MathWorks. You can get more info and download the software here. Note that you need a copy of MATLAB® on your machine. The discussion forum for the beta test will be right here in MaplePrimes. T4.

    Suppose a function is given as f:=[[.4,.2,.7],[a,b,c]]. How this can be done that writing >f(a); would give me .4 Thanks.
    I have a user defined type named FST which is like [list of numbers between 0 and 1 inclusive,list of names]. I now want to change union of two objects of type FST to be as maximum of evry pair of corresponding elemnts of first sublists. For example suppose A:=[[.3,.4,.2],[a,b,c]]; B:=[[.7,0,.2],[a,b,c]]; Then writing >A union B; should give [[.7,.4,.2],[a,b,c]] Thanking in anticipation.
    To mark the end of eleven very fruitful years in residence at the University of Waterloo, I have written a goodbye essay. The title and abstract appear below, along with a link to the full text. The essay describes my long-term research goals and presents my personal vision for the future of the areas of mathematics in which I work.
    I'm working with inverse of a complicated matrix, which is 12*12, and all the elements are symbols. The program is running forever, no results, no error message? Anybody has such kind of experience, any suggestion that what I can do? Thanks a lot, I appreciate your help!
    Suppose we have two sets A={a,b,c} and B={a,c}. And we write > A union B; we get {a,b,c}. But I want this to be replied as A only. How this can be done? Thanks.
    While responding to a question about creating a new type, I suggested that a module could be used as the data-structure. To type check a given expression against the new data-structure, one can use
    type( some_expr, '`module`'( 'export1', 'export2' ))
    
    where export1 and export2 are exports of the module. That technique, however, is not robust in that any module with those exports (and possibly others) matches the type. While that may not be a concern, there is a way to uniquely type check a constructed module: give it an export equal to a local value. Here is a demonstration of the technique:
    How can a new type be defined in Maple? For example a type named fst and given as [list of numbers between 0 and 1 inclusive, list of anything]. Further whenever this fst type object is encountered it is printed useing elements of first sublist as subscripts of elements of second sublist. Thanking in anticipation.
    Currently saving the worksheet and removing the output can only be done via the menu. It would be nice if these tasks could be performed using commands. If this would possible, one could for example start the worksheet with restart;removeoutput;saveworksheet; and never loose any programming after rerunning the script. Furhtermore, a hard break statement stopping completely the excution of the worksheet would be nice. If the current break break statement is executed, the result is to exit from the innermost repetition (for/while/do) statement within which it occurs. After exit, execution proceeds, with the first statement following the repetition statement.
    First 271 272 273 274 275 276 277 Last Page 273 of 308