SymPy Modules Reference¶
Because every feature of SymPy must have a test case, when you are not sure how
to use something, just look into the
tests/ directories, find that feature
and read the tests for it, that will tell you everything you need to know.
Most of the things are already documented though in this document, that is automatically generated using SymPy’s docstrings.
Click the “modules” (Module Index) link in the top right corner to easily access any SymPy module, or use the list below:
- Category Theory
- Code Generation
- Code printers (sympy.printing)
- Codegen (sympy.utilities.codegen)
- Classes and functions for rewriting expressions (sympy.codegen.rewriting)
- Tools for simplifying expressions using approximations (sympy.codegen.approximations)
- Classes for abstract syntax trees (sympy.codegen.ast)
- Special C math functions (sympy.codegen.cfunctions)
- C specific AST nodes (sympy.codegen.cnodes)
- C++ specific AST nodes (sympy.codegen.cxxnodes)
- Fortran specific AST nodes (sympy.codegen.fnodes)
- Algorithms (sympy.codegen.algorithms)
- Python utilities (sympy.codegen.pyutils)
- C utilities (sympy.codegen.cutils)
- Fortran utilities (sympy.codegen.futils)
- Differential Geometry
- Numerical Evaluation
- Inequality Solvers
- Computing Integrals using Meijer G-Functions
- The G-Function Integration Theorems
- The Inverse Laplace Transform of a G-function
- Implemented G-Function Formulae
- Internal API Reference
- Lie Algebra
- Number Theory
- Numeric Computation
- Polynomial Manipulation
- Printer Class
- PrettyPrinter Class
- C code printers
- C++ code printers
- Fortran Printing
- Mathematica code printing
- Maple code printing
- Julia code printing
- Octave (and Matlab) Code printing
- Rust code printing
- Aesara Code printing
- Tree Printing
- Implementation - Helper Classes/Functions
- Pretty-Printing Implementation Helpers
- Term Rewriting
- What’s wrong with solve():
- Why Solveset?
- Why do we use Sets as an output type?
- Input API of
- What is this domain argument about?
- What are the general methods employed by solveset to solve an equation?
- How do we manipulate and return an infinite solution?
- How does
solvesetensure that it is not returning any wrong solution?
- Search based solver and step-by-step solution
- How do we deal with cases where only some of the solutions are known?
- What will you do with the old solve?
- How are symbolic parameters handled in solveset?
- Solveset Module Reference
- Diophantine Equations (DEs)
- Ordinary Differential equations (ODEs)
- Partial Differential Equations (PDEs)
Contributions to Docs¶
All contributions are welcome. If you’d like to improve something, look into
the sources if they contain the information you need (if not, please fix them),
otherwise the documentation generation needs to be improved (look in the