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)
x = symbols('x')
f = (6*x+13)/(15) - 2*x/5 -(3*x+5)/(5*x-25)
solveset(f,x) # OUTPUTS 20
@aplund:matrix.org you could work with multivariate polynomials (instead of expressions) so that you can specify the polynomial variables e.g.
>>> from sympy import *
>>> a, b, t, x = symbols("a b t x")
>>> expr = a*t + a*x - b*t + b*x
>>> factor(expr)
a*t + a*x - b*t + b*x
>>> Poly(expr, a, b)
Poly((t + x)*a + (-t + x)*b, a, b, domain='ZZ[x,t]')
>>> Poly(expr, t, x)
Poly((a - b)*t + (a + b)*x, t, x, domain='ZZ[a,b]')
Alternately, you could stick with expressions and use collect
e.g.
>>> collect(expr, [a, b])
a*(t + x) + b*(-t + x)
>>> collect(expr, [t, x])
t*(a - b) + x*(a + b)
Does anyone use sympy with numpy and dill? The following code does not work when numpy gets upgraded to 1.20.1 but works fine with numpy=1.19. Running SymPy 1.7.1 and dill 0.3.3.
import dill
import sympy
from sympy.abc import x
dill.settings['recurse'] = True
expr = sympy.sympify('re(x)')
lfunc = sympy.lambdify(x, expr, 'numpy')
with open("out.pkl", 'wb') as f:
dill.dump(lfunc, f)
RecursionError: maximum recursion depth exceeded while calling a Python object
The issue occurs when re
or im
appears in an expression. Changing re
to functions such as log
works. Any clue about a fix?
Eq(x**2, True)
returns False
. But Eq(x,True)
does not. What is the reason for this behaviour?
x
can also be a boolean in the current design, so x could be True
>>> f = 4 +sqrt(2)*x + 5*x**2
>>> f = f.as_poly()
>>> f
Poly(5*x**2 + x*(sqrt(2)) + 4, x, sqrt(2), domain='ZZ')
>>> f = 4+1.414*x + 5*x**2
>>> f = f.as_poly()
>>> f
Poly(5.0*x**2 + 1.414*x + 4.0, x, domain='RR')
HI !, what I understand from the above example is that the domain refers to the 'type' of allowed coefficients that the polynomial can have and if I am not wrong, then why does the first poly have domain have Z and not R (or Q)?