A computer algebra system written in pure Python http://sympy.org/ . To get started to with contributing https://github.com/sympy/sympy/wiki/Introduction-to-contributing
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
Implemented leading term and ns… (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
made changes (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
added tests for leading terms f… (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
Changed the outputs being retur… (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
Changed leading term being ret… (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
Removed Redundant block from le… (compare)
anutosh491 on GSoC_Pr4.3_Implementing_some_series_method_for_uppergamma_lowergamma_expint_and_other_errors_functions
Implemented some series methods… (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
Removed Order term (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
added test cases for limits and… (compare)
anutosh491 on GSoC_Pr4.2_Implementing_leading_term_and_series_methods_for_the_frac_function
Implemented leading term and ns… (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
This commit does the following … Refactored mrv_leadterm in grun… Fixed errors arising for limits… and 3 more (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
fix(integrals): handle degenera… functions: Generalised Dirichle… author: update Megan Ly in .mai… and 23 more (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
Changed if condition for bessel… (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
Improved code quality (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
changed is function to equality… (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
fixed failing tests (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
Fixed code quality (compare)
anutosh491 on GSoC_Pr4.1_Implementing_few_series_methods_for_bessel_functions
Added case where number of term… (compare)
O(x**N)
in various places. I'm seeing pretty surprising results, for example (Sum(5*6**(-n)*x**n/2, (n, 1, 10)) + Rational("1/2") + O(x**11)).doit()
takes way longer than (Sum(5*6**(-n)*x**n/2, (n, 1, 10)).doit() + Rational("1/2") + O(x**11)).doit()
. The difference is the doit()
on the Sum before adding the order term. I'm also seeing some oddities when raising a polynomial with an order term to a power. Is there any guidance or something I can read to understand what's going on here and how to use order terms to be efficient?
doit()
on my Sums and instead of raising my polynomials to a power, doing a for loop with p_n = expand(p_n * p_1)
. It's not elegant, but it completes in seconds rather than OOMing my machine after several minutes. I'd guess the order term is evaluated at the end of raising something to the nth term.
phi0, phi1 = sm.symbols("phi_0 phi_1")
eta1 = 3/phi0**2 * (phi0*sm.coth(phi0) - 1)
eta2 = 3/phi1**2 * (phi1*sm.coth(phi1) - 1)
sm.nonlinsolve([3/15 - eta1/eta2,phi0 - 10*phi1], [phi0, phi1])
gives $\left\{\left( 10 \phi_{1}, \ \phi_{1}\right)\right\}$ . But its obvious that I need the solutions. Plz help
phi0
for 10*phi1
in the first equation.
exp
scipy.optimize.fsolve
but I have to rewrite the equation every time. Sometimes I' m given eta and sometimes phi. With symbolic computation I could have prevented typing the expression and and given two values of phi and an eta, I could have found the eta at another fi and vice versa for two values of eta and a phi.
The transcendental number `e = 2.718281828\ldots` is the base of the
natural logarithm and of the exponential function, `e = \exp(1)`.
Sometimes called Euler's number or Napier's constant.
Exp1 is a singleton, and can be accessed by ``S.Exp1``,
or can be imported as ``E``.
Examples
========
>>> from sympy import exp, log, E
>>> E is exp(1)
True
>>> log(E)
1
sympy.init_printing()
abc.py
as a top-level module, only as sympy.abc
or .abc
as a relative import.
@kirk86 I'm not sure if it would answer your question, but I have tried dealing with it in #20554 .
@evatiwari Thanks!