Hey Shaurya,
If you are familiar with R and Ocatve, would you be interested in helping
with parsing R and Ocatve code to SymPy expressions? You can check out
https://groups.google.com/forum/#!topic/sympy/d5Ipo90jkQc for further
reference.
You can check out Introduction to contributing
I tested the package for some basic syntax and it seems to provide a parse
tree representation for the syntax.
But, does it provide any support for traversing the tree and accessing the
children nodes, or would you need to implement that on your own?
Also, you should check out the
Thanks for the suggestion, I have started with the design for these
solvers. But I have one doubt, namely since now we are using
linear_eq_to_matrix function to check if the system of ODEs is linear or
not, would we require the canonical rearrangements part? Or rather are
there other cases
To all interested GSoC students, applications are now open at
https://summerofcode.withgoogle.com/. Be mindful that the deadline is
March 31 at 1800 UTC. This is a hard deadline. Google does not accept
late applications under any circumstances. You will be able to edit
your application up to the
Greetings everyone,,
I am Athanasios Kiatos from Greece. Currently, I am pursuing masters in
Computer, Telecommunications and Network Engineering from the
Department of Informatics and Telecommunications (DIT) of the National and
Kapodistrian University of Athens (NKUA).
I have a bachelor’s
Thanks Aaron and Nikhil for suggestions.
I have gone through javalang package and tried out few examples. AST nodes
can be traversed in javalang and children can be accessed. Here, every
relevant bunch of tokens are represented as an object of superclass
CompilationUnit(somewhat similar to
There are possibilities to go from nonlinear to linear e.g.:
In [6]: x, y = symbols('x, y', cls=Function)
In [7]: eqs = [x(t).diff(t)**2 - y(t)**2, y(t).diff(t)**2 - x(t)**2]
In [8]: eqs
Out[8]:
⎡2 2⎤
⎢ 2 ⎛d ⎞ 2 ⎛d ⎞ ⎥
⎢- y
Thanks Nikhil. I will submit my research in proposal format in few days and
will work on a patch as soon as possible.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
Hey souvik,
If you find something useful in your research, it'll be great if you can
discuss it here. We can also provide our suggestions and feedback. You can
also discuss the proposal here if you would like to before submitting,
Also, we do require you to submit at least one patch to SymPy
Another thing to consider, since this would be the third such language
to be supported in SymPy (after C and Fortran), is if there are
commonalities in the parsing code for each that should be factored out
into a helper submodule.
Aaron Meurer
On Mon, Mar 16, 2020 at 1:12 PM Gajjar Smit wrote:
Hi all
The first project that i’m most interested to work on is the “Optimize
floating point expressions”. I am familiar with Herbie and I have started
reading its source code with the purpose of adapting ideas and even code
(after re-writing it in python). How does that sound?
I
I will surely look into the commonalities in those modules if they exist
and will raise relevant issue!
On Tue 17 Mar, 2020, 12:46 AM Aaron Meurer, wrote:
> Another thing to consider, since this would be the third such language
> to be supported in SymPy (after C and Fortran), is if there are
>
12 matches
Mail list logo
