computer-algebra-systems

Closed. This question is off-topic . It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 4 years ago . I am looking for C++ open-source library (or just open-source Unix tool) to do: Equality test on Equations . Equations can be build during runtime as AST Trees, string or other format. Equations will mostly be simple algebra ones, with some assumptions about unknown functions. Domain, will be integer arithmetic (no floating point issues, as related issues are well known - Thanks @hardmath for stressing it out, I

I convert list to matrix in Maxima in following way: DataL : [ [1,2], [2,4], [3,6], [4,8] ]; DataM: apply('matrix,DataL); How to do it the other way ? How to convert given matrix DataM into list DataL ? I know it's late in the game, but for what it's worth, there is a simpler way. my_matrix : matrix ([a, b, c], [d, e, f]); my_list : args (my_matrix); => [[a, b, c], [d, e, f]] Simon I'm far from a Maxima expert, but since you asked me to look at this question , here's what I have after a quick look through the documentation . First, looking at the documentation on matrices yielded only one way

Short version: I am interested in some Clojure code which will allow me to specify the transformations of x (e.g. permutations, rotations) under which the value of a function f(x) is invariant, so that I can efficiently generate a sequence of x's that satisfy r = f(x). Is there some development in computer algebra for Clojure? For (a trivial) example (defn #^{:domain #{3 4 7} :range #{0,1,2} :invariance-group :full} f [x] (- x x)) I could call (preimage f #{0}) and it would efficiently return #{3 4 7}. Naturally, it would also be able to annotate the codomain correctly. Any suggestions? Longer

Does anybody know of any resources (books, classes, lecture notes, or anything) about the general theory of computer algebra systems (e.g. mathematica , sympy )? "Introductory" materials are preferred, but I realize that with such a specialized subject anything is bound to be fairly advanced. "General Theory" of CAS is a pretty huge scope for a question. That being said, I'll do my best to cover as much as I can in the hopes that something helps you find what you're looking for :) The proceedings of the ISSAC and SIGSAM groups would no doubt have some good stuff about techniques for building

I aim to write a multidimensional Taylor approximation using sympy , which uses as many builtin code as possible, computes the truncated Taylor approximation of a given function of two variables returns the result without the Big-O-remainder term, as e.g. in sin(x)=x - x**3/6 + O(x**4) . Here is what I tryed so far: Approach 1 Naively, one could just combine the series command twice for each variable, which unfortunately does not work, as this example shows for the function sin(x*cos(y)) : sp.sin(x*sp.cos(y)).series(x,x0=0,n=3).series(y,x0=0,n=3) >>> NotImplementedError: not sure of order of O