I've looked through the rust code on GitHub, and it's amazingly readable, like one of the good lisp systems. Esp. the matcher, eg. in the normalize or solver.
Just much faster.
Symbolica Computer Algebra System
121–126 of 126 posts
Re: Symbolica Computer Algebra System
#122I feel like this is missing some comparisons to Sympy and Mathematica. Probably it's more polished than Sympy, but if I'm going to closed-software software why would I pick this over MMA?
It depends on what you want to do. It should be much faster than Sympy and it is often much faster than Mathematica, for example if you do pattern matching or are manipulating rational polynomials. The idea of Symbolica is that you can use it as a library inside your existing projects, which is harder to do with MM since it is its own ecosystem. Moreover, for personal projects Symbolica is free.
Can Symbolica compute Gröbner bases over user specified coefficient rings? I don't see, in the docs, how one would specify such.
Re: Symbolica Computer Algebra System
#123Earlier quoted context omitted.
Completely fair, but then don't announce what is a C library, as being a C++ one, just because it uses iostream on the examples. Tell it is a C library, and announce C++ support when it is actually available.
Yeah, I agree that it should be advertised differently, stressing the obvious WIP aspect. I guess the idea is just to show that the seed for a proper C/C++ API is there, and ready to be developed further for whenever a customer requires it. Out of curiosity, what is your use case?
I was only making the point that many of us in C++ community don't appreciate libraries making the minimum effort, only because C89 is a C++ subset.
It is like shipping JavaScript libraries, and then letting Typescript users having to create .d.ts files by themselves.
In my case, I only care about GPGPU, HLSL and CUDA cover that.
Re: Symbolica Computer Algebra System
#124Please, what do you use for bigints? GMP?
I am using GMP indeed, through the Rust crate `rug`.
Thanks for the reply! If you don't mind asking more: what do you use for polynomial GCD? Apparently it is quite fast, do you use some standard algorithm implemented well or is there some kind of algorithmic improvement? Is it described somewhere, say a paper or a book? Have you tried to benchmark it against NTL, for example? Thanks again!
Re: Symbolica Computer Algebra System
#125Earlier quoted context omitted.
By just googling 'SICP Scheme' the hints are pretty clear...
The book looks awesome, thanks for pointing out, I'll give it a read.
I forgot. You can do SICP over the web without installing an Scheme interpreter.
The web has a complete enough Scheme interpreter to do and eval the whole book exercises.
http://xuanji.appspot.com/isicp/
Enjoy.
If you want something offline, I can help you to set Chicken (the interpreter), the depending libraries for SICP and Emacs in no time.
Re: Symbolica Computer Algebra System
#126It's got the startup pricing model. "Contact us for a quote!"