I am attempting to work a problem from a textbook in sympy, but sympy fails
to find a solution which appears valid. For interest, it is the design of a
PID controller using direct synthesis with a second order plus dead time
model.
The whole problem can be reduced to finding K_C, tau_I and tau_
Hi Everyone,
I've been poking around in the sympy source, and I've noticed that the `
simplify` command does not deal with expressions like the following:
>>> from sympy import *
>>> from sympy.abc import x
>>> simplify(abs(cosh(x)))
Abs(cosh(x))
A simple glance at the graph of cosh(x) reveals t
Hello ondrej, aaron
Thanks for the support . Yes I am looking for some issues in Sympy now.
Will make contribution soon . And Aaron I am a working professional,
software engineer at capgemini. I finished my bachelor's previous year may
.
Regards
Salil
On Monday, February 22, 2016, Aaron Meurer
Thanks, everybody!
--
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.
Vis
On Monday, February 22, 2016 at 6:40:59 PM UTC+1, brombo wrote:
>
> Suggestion -
>
> Modern Computer Algebra by Joachim von zur Gathen and Jurgen Gerhard
>
>
> https://www.researchgate.net/publication/220689743_Modern_computer_algebra_2_ed
>
>
> This is one of the best general references.
Here are
Suggestion -
Modern Computer Algebra by Joachim von zur Gathen and Jurgen Gerhard
https://www.researchgate.net/publication/220689743_Modern_computer_algebra_2_ed
On Mon, Feb 22, 2016 at 12:27 PM, Aaron Meurer wrote:
> There are different algorithms for different parts of SymPy. For
> instance,
Salil, if you are a student (you didn't make it clear if you are), I
would recommend applying to GSoC as a student.
Even if you aren't, as Ondrej said, we always welcome contributions.
Aaron Meurer
On Sun, Feb 21, 2016 at 11:55 AM, salil vishnu Kapur
wrote:
> Jason my username is Salil Vishnu K
There are different algorithms for different parts of SymPy. For
instance, symbolic integration has its own large set of algorithms and
literature on those algorithms (a subset of which are implemented in
SymPy). Some parts of SymPy don't have set algorithms, but are based
on some heuristics built
On Saturday, 20 February 2016 18:12:39 UTC+1, Bill Bell wrote:
>
>
> What other places can I look to understand similar algorithms?
>
>
https://reference.wolfram.com/language/tutorial/SomeNotesOnInternalImplementation.html
--
You received this message because you are subscribed to the Google
Hello everyone,
I am college student, story teller, Nolan-Sherlock Fan, science lover and
want to contribute to Sympy. I have no prior experience in open source. I
have set up the source code in my computer. Can anyone suggest easy bug to
work on?
Thanking You.
-
Parv
(parvparkh...@live.com)
That is a good question. Usually you can find open access papers for
named algorithms, try Google Scholar. Other implementations can be
found in other open source packages, the best bet would be Sage because
it *contains nearly all the other packages and is in Python as well.
Regards,
--
You rec
Thanks. Both variants are helpful!
Carsten
On 02/19/2016 08:23 PM, Aaron Meurer wrote:
> It looks like the meijerg algorithm gives the better form:
>
> In [33]: integrate(tan(x), x, meijerg=True)
> Out[33]: -log(cos(x))
>
> Aaron Meurer
>
> On Fri, Feb 19, 2016 at 2:21 PM, Ondřej Čertík
> wr
12 matches
Mail list logo
