Hi Rahul,
You can start by picking up small issues related to your project and fixing
them. The right people will tag along as you go. This is a good way to get
in touch with a new community.
Cheers
Sudhanshu Mishra
On Thu, Mar 2, 2017 at 10:17 AM, Rahul Barnwal
wrote:
> Hi everyone,
> I am a
Hi everyone,
I am a third year undergraduate at IIT Kharagpur. I went through the idea
list. I am interested to work on any of the two projects below.
1. Solvers
2. Group Theory.
Could someone let me know the mentors for these two projects, so that i can
discuss with them and finally get sta
I think we should have someone to mentor any of them. For 1 and 3, you
may want to reach out to students and mentors that did similar
projects in previous years to see what needs to be done. For 2, I
believe there are some useful discussions on this mailing list from
last year that you should be ab
I have gone through the list of ideas for GSoC 2017. I would be interested
to work on any one of the following projects subject to available mentors :
1.Series Expansions
2.Cylindrical Algebraic Decomposition
3.Efficient Groebner Bases and their Application.
If any mentor is interested in mento
The algorithms currently implemented have the following best case scenarios
for factorizing:
- Fermat's Test (When two prime numbers are close to each other)
- Pollard's Rho (When one prime factor is much smaller than the other)
- Pollard's p-1 (p&q are prime factors -> p-1 divisble by r!, q-1 no
This is something I'm working on for algebraic expressions at the moment.
Coming up with a rules based solving mechanism has been proven to be quite
a bit challenging as I'm interested in all the different variations one can
take at any given solve step. I've found myself following a similar pat
Following up on this conversation, has anyone given any thought on an
efficient way to check for structural equality for evaluate=False
expressions? This is my current implementation but I'd be curious if there
is a niftier way to check instead of manually recursing through like I've
done:
htt
Other algorithms that would be useful, if you believe you are capable of
implementing them:
- cylindrical algebraic decomposition (CAD)
- the Risch algorithm.
There are references on the ideas page. Both are challenging from a
mathematical point of view (though I believe less so than Karr).
Aar
Hi,
Here is a project that I would love to see happen:
https://github.com/sympy/sympy/issues/12233
I am available to mentor it, and I think quite a few people are
excited about it and such a system/framework (i.e. set of rules for
patter matching + compiler to generate a fast if/then/else decisi
On Wed, Mar 1, 2017 at 4:40 AM, Gaurav Dhingra
wrote:
> I've been thinking about applying again, though I am not sure what the
> project should be. Are there any good algorithms that are not implemented
> that could make a good project (I've read the ideas page)? I have 3 projects
> in mind:
> (a)
Idea:
Structural Analysis of Beams for bending, includes finding indeterminate
forces, Shear force diagram, Bending moment diagram, and diagram of
deflected beam to obtain the weaker point in the structure
Status:
Currently 'sympy.physics.continnum_mechanics.beam' module is available to
solve
I've been thinking about applying again, though I am not sure what the
project should be. Are there any good algorithms that are not
implemented that could make a good project (I've read the ideas page)? I
have 3 projects in mind:
(a). Implementation of Karr's algorithm, I believe no one has don
12 matches
Mail list logo
