[sympy] Re: GSoC 2018 : Project discussion
I have uploaded my proposal draft in Google Docs, here https://docs.google.com/document/d/1SImlbrM082Wkwk__DfmA6asteh--XypkV-B0TsxOOSU/edit#. Waiting for some reviews, and especially some discussion in the rs_series() part (if something more could be done, or if something has to be remove or replaced). Thanks, Arighna Chakrabarty -- 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/a9d51e6a-efed-4cab-9ecb-6c8ce9e8864d%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[sympy] Introduction - Ben Gatten
Hello all, My name is Ben Gatten and I am a senior in Mechanical Engineering at the University of California, Davis. I have been programming in Python for the past 4~5 months and I have another year of background in C++ 11 and Matlab. My math background consists of courses I've taken in elementary linear algebra, differential equations, and statistical methods. I have a special interest in dynamics and generating equations of motion. I've taken courses in dynamics, vibrations, and Bond Graph techniques. I had a brief introduction to Sympy in my vibrations class where we used it to calculate the Lagrangian for EOM's. Going forward, I would like to work on the mechanic's package in Sympy. I look forward to collaborating with you! -Ben -- 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/b037a845-6607-4a9a-a8fc-f1671e59f4d0%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
Re: [sympy] Re: GSoC 2018: Completing Solvers
On Fri, Mar 23, 2018 at 6:56 AM, Yathartha Joshi wrote:
> I am not sure of IndexSet usage but the reason I thought of it was that
> whenever we need to represent arbitrary set we have a notion of indexing so
> that is why I thought of having IndexSet.
> https://math.stackexchange.com/questions/485244/indexed-families-and-arbitrary-sets-notation
> http://www.math.umaine.edu/~farlow/sec22.pdf
You do need indexing to represent U A_i in general, but my point is
that ImageSet as you've defined it shouldn't be necessary.
To represent something like U [2*n, 2*n + 1] would require something
like BigUnion(Interval(2*n, 2*n + 1), n, Integers). The indexing is
done by the symbol that's used to define the set. We could also make
some way to create an arbitrary set parameterized by a variable, like
A_k so that U_{k \in I} A_k can be represented (do we currently have
any kind of arbitrary set object?).
>
>> And you still haven't answered where infinite unions are needed for
>> solveset.
>
> I thought of using BigUnion where there is a union of more than one
> imagesets, (like in case of trigonometric equations)
>
solveset(sin(x), x, S.Reals)
> Union(ImageSet(Lambda(_n, 2*_n*pi), S.Integers), ImageSet(Lambda(_n, 2*_n*pi
> + pi), S.Integers))
> # (sin(2*x) + sin(4*x) + sin(6*x)) will have lots of union of imagesets
> BigUnion could give `ImageSet(Lambda(_n, _n*pi), S.Integers)`, (although
> _union of imageset is under development, BigUnion can act as helper)
I'm still not following why it is needed, since this is still a union
of a finite number of sets (even though the sets themselves are
infinite). But maybe I'm missing something.
However, I suppose it could be useful for inequalities, and possibly
solutions in the complex domain or in higher dimensions. For instance,
sin(x) >= 0 has a solution set U_{n integer} [2*n*pi, (2*n + 1)*pi].
>
> I guess this is an idea that is in an initial stage (and that is why I can't
> imagine it in larger scale), and if you suggest that it won't be feasible I
> would rather remove it from the proposal.
I think it is feasible. BigUnion is probably quite straightforward to
implement, once we agree on an API.
Aaron Meurer
>
> Thanks
> Yathartha
> On Friday, March 23, 2018 at 11:56:03 AM UTC+5:30, Aaron Meurer wrote:
>>
>> I'm not seeing an instance where IndexSet is useful. For finite
>> collections of sets, it is redundant, as Union and Intersection can
>> already take a finite number of arguments. For infinite collections,
>> whatever symbol you index over would already exist in the collection
>> itself (for instance, n in Interval(2*n, 2*n + 1))
>>
>> And you still haven't answered where infinite unions are needed for
>> solveset.
>>
>> Aaron Meurer
>>
>> On Fri, Mar 23, 2018 at 12:14 AM, Yathartha Joshi
>> wrote:
>> > What I understood about BigUnion and BigIntersection from here. BigUnion
>> > for
>> > set of finitesets will work similar to union but for set of imagesets
>> > (infinite sets) we will be returning a unified solution.
>> >
>> > say for eg: [2*n , 2*n - 1 for n in Integers] passing it to Bigunion
>> > will
>> > yield something like [n for n in Integers] and BigIntersection would
>> > yield
>> > EmptySet.
>> >
>> > See https://github.com/sympy/sympy/issues/9815#issuecomment-373978030
>> >
>> > In solveset when union of imagesets are returned we can apply big union
>> > to
>> > get the unified result (probably could help the _union of imagesets once
>> > its
>> > implemented).
>> >
>> > IndexSet will be implemented to get access to set of sets through
>> > indexing,
>> > a number of sets will be passed as parameters and an instance of
>> > IndexSet
>> > will be returned with indices mapped to each of the sets in the sets.
>> > This
>> > way we can get access to a set of sets.
>> >
>> X = IndexSet(FiniteSet(1, 2, ,3), FiniteSet(4, 5)); X
>> X[0]
>> > FiniteSet(1, 2 ,3)
>> X[1]
>> > FiniteSet(4, 5)
>> >
>> >
>> > On Friday, March 23, 2018 at 5:44:13 AM UTC+5:30, Aaron Meurer wrote:
>> >>
>> >> Regarding BigUnion, what is the point of having it and IndexSet that
>> >> can only represent a finite number of sets? Union can already do this
>> >> without the indirection. I'm also unclear where this will be needed
>> >> for solveset.
>> >>
>> >> Aaron Meurer
>> >>
>> >> On Thu, Mar 22, 2018 at 4:38 PM, Yathartha Joshi
>> >> wrote:
>> >> > Sorry I just gave the access to amit kumar, I have changed it, please
>> >> > have a
>> >> > look.
>> >> >
>> >> > Thanks!
>> >> >
>> >> >
>> >> > On Friday, March 23, 2018 at 1:54:31 AM UTC+5:30, Aaron Meurer wrote:
>> >> >>
>> >> >> When I click on that link it says I don't have access.
>> >> >>
>> >> >> I recommend starting your proposal on
>> >> >> https://summerofcode.withgoogle.com and linking the draft proposal
>> >> >> there. That will make it easier to find in the future.
>> >> >>
>> >> >> Aaron Meurer
>> >> >>
>> >> >> On Thu, Mar 22, 2018 at 4:01 PM, Yathartha Joshi
>> >> >>
>> >> >> wrote:
>> >> >> > I h
[sympy] Re: GSoC 2018: Solvers: Completing solveset
Here is the link of my GSoC proposal: [https://docs.google.com/document/d/1LOtMTr9cCrzQ8_OnKrgkZs8wFS9N9PxlR10h3aKG0jg/edit] Although its not complete, I will be completing it soon(especially the phase-3 part) Just need to discuss about the idea of connecting solveset with diophantine,py. I find it really good. Looking forward for feedback and guidances. On Monday, 12 March 2018 22:00:04 UTC+5:30, Ishan Anirudh Joshi wrote: > > Hi everyone, > > I am Ishan Joshi, a second year undergrad. pursuing Manufacturing and > Automation Engineering at Netaji Subhas Institute of Technology, India. > I have been contributing to the codebase of SymPy since July 2017. > I am willing to be a part of GSoC 2018 under the Mathematics project: > "Solvers: Completing solveset". > A lot have been done in the previous GSoCs and still quite a lot has to be > done in making solveset as powerful as solve. > TODO's: > >- Transcendental equation solver >- Integrating helper solvers with solveset >- Building the set infrastructure >- nonlinsolve > > These are some things to be done in the solveset module. > Looking forward for feedback and guidances for the project. > Thanks in advance! > > -- 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/efcbc122-caeb-4fe9-9a2e-08b6abdbe1e7%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[sympy] Inquiry for GSoC physics proposal
Sir, I am an engineering student applying for GSoc this year. I am interested and good in physics and mathematics so I want to apply for SymPy physics project. But the problem is that I do not have an idea about how to submit a patch to SymPy because I am new to open source and the instructions says that you should have to submit at least one patch to SymPy along with your application. I am proficient in C, C++, Python and Java but I have not worked on an open source before and I am willing to learn this if I get selected for GSoC. Can you please guide me if I can proceed with my proposal without the experience of open source. Resume - https://docs.google.com/document/d/183KLHw9nQ_0Bwcea9qwbC4KHUYC_Jou2C1JRY0WDsp0/edit?usp=sharing Thanks Sarthak Singhal -- 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/3b106596-c11c-469d-9b2b-cfb737be5090%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
Re: [sympy] Re: GSoC 2018: Completing Solvers
I am not sure of IndexSet usage but the reason I thought of it was that whenever we need to represent arbitrary set we have a notion of indexing so that is why I thought of having IndexSet. https://math.stackexchange.com/questions/485244/indexed-families-and-arbitrary-sets-notation http://www.math.umaine.edu/~farlow/sec22.pdf > And you still haven't answered where infinite unions are needed for solveset. I thought of using BigUnion where there is a union of more than one imagesets, (like in case of trigonometric equations) >>> solveset(sin(x), x, S.Reals) Union(ImageSet(Lambda(_n, 2*_n*pi), S.Integers), ImageSet(Lambda(_n, 2*_n*pi + pi), S.Integers)) # (sin(2*x) + sin(4*x) + sin(6*x)) will have lots of union of imagesets BigUnion could give `ImageSet(Lambda(_n, _n*pi), S.Integers)`, (although _union of imageset is under development, BigUnion can act as helper) I guess this is an idea that is in an initial stage (and that is why I can't imagine it in larger scale), and if you suggest that it won't be feasible I would rather remove it from the proposal. Thanks Yathartha On Friday, March 23, 2018 at 11:56:03 AM UTC+5:30, Aaron Meurer wrote: > > I'm not seeing an instance where IndexSet is useful. For finite > collections of sets, it is redundant, as Union and Intersection can > already take a finite number of arguments. For infinite collections, > whatever symbol you index over would already exist in the collection > itself (for instance, n in Interval(2*n, 2*n + 1)) > > And you still haven't answered where infinite unions are needed for > solveset. > > Aaron Meurer > > On Fri, Mar 23, 2018 at 12:14 AM, Yathartha Joshi > wrote: > > What I understood about BigUnion and BigIntersection from here. BigUnion > for > > set of finitesets will work similar to union but for set of imagesets > > (infinite sets) we will be returning a unified solution. > > > > say for eg: [2*n , 2*n - 1 for n in Integers] passing it to Bigunion > will > > yield something like [n for n in Integers] and BigIntersection would > yield > > EmptySet. > > > > See https://github.com/sympy/sympy/issues/9815#issuecomment-373978030 > > > > In solveset when union of imagesets are returned we can apply big union > to > > get the unified result (probably could help the _union of imagesets once > its > > implemented). > > > > IndexSet will be implemented to get access to set of sets through > indexing, > > a number of sets will be passed as parameters and an instance of > IndexSet > > will be returned with indices mapped to each of the sets in the sets. > This > > way we can get access to a set of sets. > > > X = IndexSet(FiniteSet(1, 2, ,3), FiniteSet(4, 5)); X > X[0] > > FiniteSet(1, 2 ,3) > X[1] > > FiniteSet(4, 5) > > > > > > On Friday, March 23, 2018 at 5:44:13 AM UTC+5:30, Aaron Meurer wrote: > >> > >> Regarding BigUnion, what is the point of having it and IndexSet that > >> can only represent a finite number of sets? Union can already do this > >> without the indirection. I'm also unclear where this will be needed > >> for solveset. > >> > >> Aaron Meurer > >> > >> On Thu, Mar 22, 2018 at 4:38 PM, Yathartha Joshi > >> wrote: > >> > Sorry I just gave the access to amit kumar, I have changed it, please > >> > have a > >> > look. > >> > > >> > Thanks! > >> > > >> > > >> > On Friday, March 23, 2018 at 1:54:31 AM UTC+5:30, Aaron Meurer wrote: > >> >> > >> >> When I click on that link it says I don't have access. > >> >> > >> >> I recommend starting your proposal on > >> >> https://summerofcode.withgoogle.com and linking the draft proposal > >> >> there. That will make it easier to find in the future. > >> >> > >> >> Aaron Meurer > >> >> > >> >> On Thu, Mar 22, 2018 at 4:01 PM, Yathartha Joshi > > >> >> wrote: > >> >> > I have created a proposal here. It would be great if you could > review > >> >> > it > >> >> > and > >> >> > suggest any changes. > >> >> > > >> >> > Thanks in advance. > >> >> > Yathartha > >> >> > > >> >> > On Thursday, March 22, 2018 at 11:08:27 PM UTC+5:30, Yathartha > Joshi > >> >> > wrote: > >> >> >> > >> >> >> > >> >> >> On Thursday, March 22, 2018 at 2:26:18 PM UTC+5:30, Amit Kumar > >> >> >> wrote: > >> >> >>> > >> >> >>> Hey Yathartha, > >> >> >>> > >> >> >>> That sounds good. > >> >> >>> > >> >> >>> Cheers! > >> >> >>> Amit > >> >> >> > >> >> >> > >> >> >> Okay! Thanks. > >> >> >> > >> >> >> Also, I was thinking was making absolute value expressions to > work > >> >> >> in > >> >> >> complex domain. I found a few equations that have complex > solutions: > >> >> >> > >> >> >> > >> >> >> > http://www.wolframalpha.com/input/?i=solve(abs(x-2)+%2Babs(x)+-+7,+x) > >> >> >> http://www.wolframalpha.com/input/?i=solve(abs(x-2)+-2+,+x) > >> >> >> > >> >> >> > >> >> >> > >> >> >> > http://www.wolframalpha.com/input/?i=solve(abs(x-2)+%2Babs(x+%2B4)+-+16,+x) > >> >> >> > >> >> >> I was trying
[sympy] Re: GSoC 2018: Implementation of Vector Integration
I have started a wiki page for my proposal, here is the link : https://github.com/sympy/sympy/wiki/GSoC-2018-Application-Adwait-Baokar:-Implementation-of-Vector-Integration Please have a look and suggest any changes Thank You -- 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/c8121b07-0070-42c6-9529-2059c3a9973f%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
