 |
Cadabra
Computer algebra system for field theory problems
|
|
Cadabra
Computer algebra system for field theory problems
|
Containing all algorithms acting on symbolic expression trees.
Namespaces | |
| namespace | cadabra |
| Functions to handle the exchange properties of two or more symbols in a product. | |
Classes | |
| class | cadabra::canonicalise |
| Canonicalise the index structure of a tensorial expression. More... | |
| class | cadabra::collect_components |
Collect \components terms inside a sum, merging their substitution rules. More... | |
| class | cadabra::collect_factors |
| Collect symbolically equal factors in a product. More... | |
| class | cadabra::collect_terms |
| Collect symbolically equal terms in a sum. More... | |
| class | cadabra::complete |
| Complete a set of coordinate rules so that they also cover related tensors. More... | |
| class | cadabra::decompose_product |
| Decompose a product of tensors by applying Young projectors. More... | |
| class | cadabra::distribute |
| Distribute factors over a sum, that is, \( (A+B) C \rightarrow A C + B C \). More... | |
| class | cadabra::einsteinify |
| class | cadabra::factor_in |
| class | cadabra::factor_out |
| class | cadabra::first_order_form |
| Transform a (system of) higher order ODEs to first order, and ensure that the derivatives are on the lhs with all the other terms on the rhs. More... | |
| class | cadabra::integrate_by_parts |
| Integrate by parts away from the indicated derivative object. More... | |
| class | cadabra::map_mma |
| Functionality to act with Mathematica on all scalar parts of an expression, and keep the result in-place. More... | |
| class | cadabra::map_sympy |
| Functionality to act with Sympy on all scalar parts of an expression, and keep the result in-place. More... | |
| class | cadabra::simplify |
| General purpose brute force scalar simplification algorithm. More... | |
| class | cadabra::split |
| Split an expression into terms or factors. More... | |
| class | cadabra::substitute |
| Generic substitution algorithm. More... | |
| class | cadabra::vary |
| Generic variational derivative algorithm. More... | |
Typedefs | |
| typedef std::map< Ex::iterator, std::pair< multiplier_t, Ex::sibling_iterator >, Ex::iterator_base_less > | cadabra::equiv_map_t |
| Given an ExNode iterator, find all expressions in its range which are equal up to a numerical multiplier. | |
| typedef std::map<Ex::iterator, std::pair<multiplier_t, Ex::sibling_iterator>, Ex::iterator_base_less> cadabra::equiv_map_t |
Given an ExNode iterator, find all expressions in its range which are equal up to a numerical multiplier.
Return a structure which summarises these equivalencies,
1.9.8