The application period has opened. I've updaed the questions at
https://github.com/sympy/sympy/wiki/gsoc-2014-organization-application,
but I haven't changed the content yet. Feel free to edit that page
however you want (I will review all changes from the wiki history
before I submit). Also, take
In addition to the application, we need to have the ideas page ready
(this is actually in many ways more important than the application).
See https://github.com/sympy/sympy/wiki/gsoc-2014-ideas.
We also need to know who is willing to mentor. If you are willing to
mentor at all, even if only for sp
Hi,
I have added references about algorithms as well as added a new
section "Demo" in my proposal. I know it's very near the deadline and
I may be spamming. The proposal already had some reviews from Aaron
Meurer and David Joyner. Just posting it notifying about the changes
made in proposal. I am
> SymPy has a function called test_numerically in
> sympy.utilities.randtest that can help with this approach.
Cool, I wasn't aware of that. Good to know.
Luke
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop r
Hi Dale,
The problem has been fixed, the function works and has passed all tests. I
got some help from Stefan.
It can still be improved though, so any comments would help. In the end
this might not even go into the test file. I'm waiting for a reply on the
PyDy group about where this code should
On Thu, May 2, 2013 at 8:09 PM, Dale Lukas Peterson
wrote:
> I am quite swamped and only was briefly able to look at your pull
> request but I would advise not using or relying on simplify in tests
> if at all possible. For one, it is slow, and it alos gives different
> results depending on pytho
I am quite swamped and only was briefly able to look at your pull
request but I would advise not using or relying on simplify in tests
if at all possible. For one, it is slow, and it alos gives different
results depending on python versions, and finally, its implementation
could easily change down
Hi everyone,
Regarding Pull request #2067, I guess the simplify() command works in
different ways on different python versions. So my test works on python 2.7
but not on the other versions. That's rather strange.
Could someone help me out with this?
Varun Joshi
On Thu, May 2, 2013 at 6:16 AM, V
Hi,
I have made refinements of proposal, adding more details and
pseudocode. I would appreciate any feedback from community members.
https://google-melange.appspot.com/gsoc/proposal/review/google/gsoc2013/saurabh_jha/11001
Sincerely,
-Saurabh Jha
On Apr 27, 2:55 pm, Saurabh Jha wrote:
> Hi
>
> I
> Then that task is probably not for you.
Thanks anyway, I'll look for the corresponding literature.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this group, send email
Am 04.04.2012 23:04, schrieb Sergiu Ivanov:
In [0] they say that
It can parse context-sensitive, infinite look-ahead grammars but it
performs best on predictive (LL[1]) grammars.
Sounds like LL(*), which is going to perform badly on left recursion.
I hear there are ways around this, but
On Wed, Apr 4, 2012 at 10:08 PM, Joachim Durchholz wrote:
> Am 04.04.2012 17:59, schrieb Dmitry Kozlov:
>>
>> Haskell-like monadic parse combinators, but they can give low
>> perfomance in python.nnn
>
> AFAIK they are limited to LL(k) grammars.
> If that is correkt, they are not suitable.
In [0]
Am 04.04.2012 17:59, schrieb Dmitry Kozlov:
Unfortunately, I have never been in
touch with Earley algorithm.
Then that task is probably not for you.
> So I thought, final approach is to
implement flexible parse classes that can potentially describe
grammars of text formats which uses Mathemat
Excuse me, I did not write sooner. It was nessesary to do all thing
related to university. Now Im afraid I have no time. But anyway,
> OK. What exactly would like to implement?
I red this issue https://github.com/sympy/sympy/wiki/Parsing
Well, the task is to implement a parser framework for sympy
On Sat, Mar 24, 2012 at 3:27 PM, Alexey U. Gudchenko wrote:
>
>
> On 25.03.2012 00:57, Sergiu Ivanov wrote:
>> On Sat, Mar 24, 2012 at 9:23 PM, Dmitry Kozlov
>> wrote:
>>> Excuse me, I am not good in english. I wonder how many time has
>>> applicant to write a patch?
>>
>> Don't worry, your Engli
On Sat, Mar 24, 2012 at 11:24 PM, Aaron Meurer wrote:
> On Sat, Mar 24, 2012 at 2:57 PM, Sergiu Ivanov
> wrote:
>> On Sat, Mar 24, 2012 at 9:23 PM, Dmitry Kozlov wrote:
>>> Excuse me, I am not good in english. I wonder how many time has
>>> applicant to write a patch?
>>
>> According to [0], you
On 25.03.2012 00:57, Sergiu Ivanov wrote:
> On Sat, Mar 24, 2012 at 9:23 PM, Dmitry Kozlov
> wrote:
>> Excuse me, I am not good in english. I wonder how many time has
>> applicant to write a patch?
>
> Don't worry, your English is rather OK.
>
> According to [0], you are required to submit at
On Sat, Mar 24, 2012 at 2:57 PM, Sergiu Ivanov
wrote:
> On Sat, Mar 24, 2012 at 9:23 PM, Dmitry Kozlov wrote:
>>> Which one of these you like most? There are already on-going
>>> discussions on both of these topics (for example, [0] and [1], but
>>> there are more), you may find looking at them
On Sat, Mar 24, 2012 at 9:23 PM, Dmitry Kozlov wrote:
>> Which one of these you like most? There are already on-going
>> discussions on both of these topics (for example, [0] and [1], but
>> there are more), you may find looking at them useful.
> I'd like to implement parsers, since I have no bac
> Which one of these you like most? There are already on-going
> discussions on both of these topics (for example, [0] and [1], but
> there are more), you may find looking at them useful.
I'd like to implement parsers, since I have no background in symbolic
integration. Thanks for references.
> A
I've pushed a patch: https://github.com/sympy/sympy/pull/208
Please review it.
On 5 апр, 17:53, Effect wrote:
> Hello,
>
> I've created a page on a wiki with my application for
> GSoC'2011:https://github.com/sympy/sympy/wiki/GSoC-2011-Application-Pavel-Fedot...
>
> I continue working with my pr
Hi, thank you for comments,
I've looked closer on SymPy's capabilities and choose concrete
algorithms to be implemented during GSoC.
In brief, they are:
- EEZ-GCD algorithm;
- coefficient prediction sub-algorithm of EEZ for iterations 2..n;
- polynomial multiplication and division based on heaps (
On 7 Apr., 08:54, Hector wrote:
> Hello people,
>
> Sorry, I couldn't be active in the community in the recent days and for
> asking again to review my GSoC proposal[1].
>
> One more thing, one of my patch has been added and I have one open pull
> request[2]. The first was only about adding a doc-
Dear all,
I'm just bumping this up to let potential mentors and/or application
reviewers (except for Aaron and Ronan, thanks a lot again for your
input!) know that my application is at [1]. If there is anything
unclear to you, or if there is anything you would like me to add or
expand on, please d
On Mar 27, 2011, at 1:06 PM, Vinzent Steinberg wrote:
> Welcome!
>
> On Mar 27, 10:51 am, Deshe wrote:
>> Hello
>>
>> I've published an application for a project and, as your page
>> suggests, I'm turning to anyone kind enough to help me improve it.
>>
>> It's currently very unstructured, and
Welcome!
On Mar 27, 10:51 am, Deshe wrote:
> Hello
>
> I've published an application for a project and, as your page
> suggests, I'm turning to anyone kind enough to help me improve it.
>
> It's currently very unstructured, and I'd appreciate any insight
> building a feasible work program which i
Thanks for the reply. Just to let you know, I started a wiki page, as
suggested:
https://github.com/sympy/sympy/wiki/GSoC%202011%20Tom%20Bachmann:%20Definite%20Integration
> By the way, the integration algorithms are my particular interest in SymPy,
> so I would like to discuss this more with yo
27 matches
Mail list logo
