--- - branch: MAIN date: Tue Jan 21 08:38:04 UTC 2014 files: - new: '1.14' old: '1.13' path: pkgsrc/math/py-sympy/Makefile pathrev: pkgsrc/math/py-sympy/Makefile@1.14 type: modified - new: '1.9' old: '1.8' path: pkgsrc/math/py-sympy/PLIST pathrev: pkgsrc/math/py-sympy/PLIST@1.9 type: modified - new: '1.8' old: '1.7' path: pkgsrc/math/py-sympy/distinfo pathrev: pkgsrc/math/py-sympy/distinfo@1.8 type: modified id: 20140121T083804Z.4a703518c5e1d1507fdf213f5c6648257738351e log: "Update to 0.7.4.1:\n\n0.7.4.1\n\nThese are the release notes for SymPy 0.7.4.1, which was released\non December 15, 2013.\n\nThis version of SymPy has been tested on Python 2.6, 2.7, 3.2, 3.3,\nand PyPy.\n\nThis was a small bugfix release to fix an import issue on Windows\n(https://github.com/sympy/sympy/issues/2681).\n\n0.7.4\n\nThese are the release notes for SymPy 0.7.4, which was released on\nDecember 9, 2013.\n\nThis version of SymPy has been tested on Python 2.6, 2.7, 3.2, 3.3,\nand PyPy.\nMajor changes\nPython 3\n\nSymPy now uses a single code-base for Python 2 and Python 3.\nGeometric Algebra\n\nThe internal representation of a multivector has been changes to\nmore fully use the inherent capabilities of SymPy. A multivector\nis now represented by a linear combination of real commutative\nSymPy expressions and a collection of non-commutative SymPy symbols.\nEach non-commutative symbol represents a base in the geometric\nalgebra of an N-dimensional vector space. The total number of\nnon-commutative bases is 2**N - 1 (N of which are a basis for the\nvector space) which when including scalars give a dimension for\nthe geometric algebra of 2**N. The different products of geometric\nalgebra are implemented as functions that take pairs of bases\nsymbols and return a multivector for each pair of bases.\n\nThe LaTeX printing module for multivectors has been rewritten to\nsimply extend the existing sympy LaTeX printing module and the\nsympy LaTeX module is now used to print the bases coefficients in\nthe multivector representation instead of writing an entire LaTeX\nprinting module from scratch.\n\nThe main change in the geometric algebra module from the viewpoint\nof the user is the inteface for the gradient operator and the\nimplementation of vector manifolds:\n\nThe gradient operator is now implemented as a special vector (the\nuser can name it grad if they wish) so the if F is a multivector\nfield all the operations of grad on F can be written grad*F, F*grad,\ngrad^F, F^grad, grad|F, F|grad, gradF, and F>grad\nwhere **, ^, |, <, and > are the geometric product, outer product,\ninner product, left contraction, and right contraction, respectively.\n\nThe vector manifold is defined as a parametric vector field in an\nembedding vector space. For example a surface in a 3-dimensional\nspace would be a vector field as a function of two parameters. Then\nmultivector fields can be defined on the manifold. The operations\navailable to be performed on these fields are directional derivative,\ngradient, and projection. The weak point of the current manifold\nrepresentation is that all fields on the manifold are represented\nin terms of the bases of the embedding vector space.\nClassical Cryptography\n\nImplements:\n\n Affine ciphers\n \ Vigenere ciphers\n Bifid ciphers\n Hill ciphers\n RSA and \"kid RSA\"\n \ linear feedback shift registers.\n\nCommon Subexpression Elimination (CSE)\n\nMajor changes have been done in cse internals resulting in a big\nspeedup for larger expressions. Some changes reflect on the user\nside:\n\n Adds and Muls are now recursively matched ([w*x, w*x*y, w*x*y*z]\n å\x9A¢ow turns into [(x0, w*x), (x1, x0*y)], [x0, x1, x1*z])\n CSE is now not performed on the non-commutative parts of\n multiplications (it avoids some bugs).\n Pre and post optimizations are not performed by default anymore.\n The optimizations parameter still exists and optimizations='basic'\n can be used to apply previous default optimizations. These\n optimizations could really slow down cse on larger expressions\n and are no guarantee of better results.\n An order parameter has been introduced to control whether Adds\n and Muls terms are ordered independently of hashing implementation.\n The default order='canonical' will independently order the\n \ terms. order='none' will not do any ordering (hashes order is\n used) and will represent a major performance improvement for\n really huge expressions.\n \ In general, the output of cse will be slightly different from\n the previous implementation.\n\nDiophantine Equation Module\n\nThis is a new addition to SymPy as a result of a GSoC project. With\nthe current release, following five types of equations are supported.\n\n Linear Diophantine equation, a_{1}x_{1} + a_{2}x_{2} + . . .\n + a_{n}x_{n} = b\n General binary quadratic equation, ax^2 + bxy + cy^2 + dx + ey\n + f = 0\n Homogeneous ternary quadratic equation, ax^2 + by^2 + cz^2 +\n dxy + eyz + fzx = 0\n Extended Pythagorean equation, a_{1}x_{1}^2 + a_{2}x_{2}^2 +\n . . . + a_{n}x_{n}^2 = a_{n+1}x_{n+1}^2\n General sum of squares, x_{1}^2 + x_{2}^2 + . . . + x_{n}^2 =\n k\n\nUnification of Sum, Product, and Integral classes\n\nA new superclass has been introduced to unify the treatments of\nindexed expressions, such as Sum, Product, and Integral. This\nenforced common behavior accross the objects, and provides more\nrobust support for a number of operations. For example, Sums and\nIntegrals can now be factored or expanded. S.subs() can be used to\nsubstitute for expressions inside a Sum/Integral/Product that are\nindependent of the index variables, including unknown functions,\nfor instance, Integral(f(x), (x, 1, 3)).subs(f(x), x**2), while\nSum.change_index() or Integral.transform are now used for other\nchanges of summation or integration variables. Support for finite\nand infinite sequence products has also been restored.\n\nIn addition there were a number of fixes to the evaluation of nested\nsums and sums involving Kronecker delta functions, see issue 3924\nand issue 3987.\nSeries\n\n \ The Order object used to represent the growth of a function in\n series expansions as a variable tend to zero can now also\n represent growth as a variable tend to infinity. This also\n fixed a number of issues with limits. See issue 234 and issue\n 2670.\n\n Division by Order is disallowed, see issue 1756.\n\n Addition of Order object is now commutative, see issue 1180.\n\nPhysics\n\n \ Initial work on gamma matrices, depending on the tensor module.\n\nLogic\n\n \ New objects true and false which are Basic versions of the\n Python builtins True and False.\n\nOther\n\n Arbitrary comparisons between expressions (like x < y) no longer\n have a boolean truth value. This means code like if x < y or\n sorted(exprs) will raise TypeError if x < y is symbolic. A\n typical fix of the former is if (x < y) is True (assuming the\n if block should be skipped if x < y is symbolic), and of the\n latter is sorted(exprs, key=default_sort_key), which will order\n the expressions in an arbitrary, but consistent way, even across\n platforms and Python versions. See issue 2832.\n\n Arbitrary comparisons between complex numbers (for example, I\n > 1) now raise TypeError as well (see PR #2510).\n\n minpoly now works with algebraic functions, like minpoly(sqrt(x)\n \ + sqrt(x + 1), y).\n\n exp can now act on any matrix, even those which are not\n diagonalizable. It is also more comfortable to call it, exp(m)\n \ instead of just m.exp(), as was required previously.\n\n sympify now has an option evaluate=False that will not\n automatically simplify expressions like x+x.\n\n Deep processing of cancel and simplify functions. simplify is\n \ now recursive through the expression tree. See e.g. issue 3923.\n\n Improved the modularity of the codebase for potential subclasses,\n see issue 3652.\n\n \ The SymPy cheatsheet was cleaned up.\n\nBackwards compatibility breaks and deprecations\n\n Removed deprecated Real class and is_Real property of Basic,\n \ see issue 1721.\n Removed deprecated 'each_char' option for symbols(), see issue\n 1919.\n The viewer=\"StringIO\" option to preview() has been deprecated.\n Use viewer=\"BytesIO\" instead. See issue 3984.\n TransformationSet has been renamed to ImageSet. Added public\n facing imageset function.\n\n0.7.3\n\nThese are the release notes for SymPy 0.7.3, which was released on\nJuly 13, 2013. It can be downloaded from\nhttps://github.com/sympy/sympy/releases/tag/sympy-0.7.3.\n\nThis version of SymPy has been tested on Python 2.5, 2.6, 2.7, 3.2,\n3.3, and PyPy.\nMajor changes\nIntegration\n\nThis release includes Risch integration algorithm from Aaron Meurer's\n2010 Google Summer of Code project. This makes integrate much more\npowerful and much faster for the supported functions. The algorithm\nis called automatically from integrate(). For now, only transcendental\nelementary functions containing exp or log are supported. To access\nthe algorithm directly, use integrate(expr, x, risch=True). The\nalgorithm has the ability to prove that integrals are nonelementary.\nTo determine if a function is nonelementary, integrate using\nrisch=True. If the resulting Integral class is an instance of\nNonElementaryIntegral, then it is not elementary (otherwise, that\npart of the algorithm has just not been implemented yet).\n\nHere is an example integral that could not be computed before:\n\n>>> f = x*(x + 1)*(2*x*(x - (2*x**3 + 2*x**2 + x + 1)*log(x +\n1))*exp(3*x**2) + (x**2*exp(2*x**2) - log(x + 1)**2)**2)/((x +\n1)*log(x + 1)**2 - (x**3 + x**2)*exp(2*x**2))**2\n>>> integrate(f, x)\nx + x*exp(x**2)*log(x + 1)/(x**2*exp(2*x**2) - log(x + 1)**2) -\nlog(x + 1) - log(exp(x**2) - log(x + 1)/x)/2 + log(exp(x**2) +\nlog(x + 1)/x)/2\n\nODE\n\n \ Built basic infrastructure of the PDE module (PR #1970)\n\nTheano Interaction\n\nSymPy expressions can now be translated into Theano expressions\nfor numeric evaluation. This includes most standard scalar operations\n(e.g. sin, exp, gamma, but not beta or MeijerG) and matrices. This\nsystem generally outperforms lambdify and autowrap but does require\nTheano to be installed.\nMatrix Expressions\nAssumptions\n\nMatrix expressions now support inference using the new assumptions\nsystem. New predicates include invertible, symmetric, positive_definite,\northogonal, ....\nNew Operators\n\nNew operators include Adjoint, HadamardProduct, Determinant,\nMatrixSlice, DFT. Also, preliminary support exists for factorizations\nlike SVD and LU.\nContext manager for New Assumptions\n\nAdded the with assuming(*facts) context manager for new assumptions.\nSee blogpost\nBackwards compatibility breaks and deprecations\n\n \ This is the last version of SymPy to support Python 2.5.\n\n The IPython extension, i.e., %load_ext\n sympy.interactive.ipythonprinting is deprecated. Use from sympy\n import init_printing; init_printing() instead. See issue 3914.\n\n \ The viewer='file' option to preview without a file name is\n deprecated. Use filename='name' in addition to viewer='file'.\n See issue 3919.\n\n The deprecated syntax Symbol('x', dummy=True), which had been\n deprecated since 0.7.0, has been removed. Use Dummy('x') or\n symbols('x', cls=Dummy) instead. See issue 3378.\n\n The deprecated Expr methods as_coeff_terms and as_coeff_factors,\n \ which have been deprecated in favor of as_coeff_mul and\n as_coeff_add, respectively (see also as_coeff_Mul and as_coeff_Add),\n were removed. The methods had been deprecated since SymPy 0.7.0.\n See issue 3377.\n\n The spherical harmonics have been completely rewritten. See PR\n #1510.\n\nMinor changes\nSolvers\n\n Added enhancements and improved the methods of solving exact\n differential equation ((PR #1955)) and ((PR #1823))\n Support for differential equations with linear coefficients\n and those that can be reduced to separable and linear form ((PR\n #1940), (PR #1864), (PR #1883))\n Support for first order linear general PDE's with constant\n coefficients ((PR #2109))\n \ Return all found independent solutions for underdetermined\n systems.\n \ Handle recursive problems for which y(0) = 0.\n Handle matrix equations.\n\nIntegration\n\n \ integrate will split out integrals into Piecewise expressions\n when conditions must hold for the answer to be true. For example,\n integrate(x**n, x) now gives Piecewise((log(x), Eq(n, -1),\n (x**(n + 1)/(n + 1), True)) (previously it just gave x**(n +\n 1)/(n + 1))\n Calculate Gauss-Legendre and Gauss-Laguerre points and weights\n (PR #1497)\n Various new error and inverse error functions (PR #1703)\n Use in heurisch for more symmetric and nicer results\n Gruntz for expintegrals and all new erf*\n Li, li logarithmic integrals (PR #1708)\n \ Integration of li/Li by heurisch (PR #1712)\n elliptic integrals, complete and incomplete\n Integration of complete elliptic integrals by meijerg\n Integration of Piecewise with symbolic conditions.\n Fixed many wrong results of DiracDelta integrals.\n\nLogic\n\n Addition of SOPform and POSform functions to sympy.logic to\n generate boolean expressions from truth tables.\n Addition of simplify_logic function and enabling simplify() to\n reduce logic expressions to their simplest forms.\n Addition of bool_equals function to check equality of boolean\n expressions and return a mapping of variables from one expr to\n other that leads to the equality.\n Addition of disjunctive normal form methods - to_dnf, is_dnf\n\nOthers\n\n \ gmpy version 2 is now supported\n Added is_algebraic_expr() method (PR #2176)\n Many improvements to the handling of noncommutative symbols:\n\tBetter support in simplification functions, e.g. factor,\n\ttrigsimp\n\tBetter integration with Order()\n\tBetter pattern matching\n Improved pattern matching including matching the identity.\n normalizes Jacobi polynomials\n Quadrature rules for orthogonal polynomials in arbitrary\n precision (hermite, laguerre, legendre, gen_legendre, jacobi)\n summation of harmonic numbers\n Many improvements of the polygamma functions\n evaluation at special arguments\n Connections to harmonic numbers\n structured full partial fraction decomposition (mainly interesting\n for developers)\n besselsimp improvements\n Karr summation convention\n New spherical harmonics\n improved minimal_polynomial using composition of algebraic\n numbers (PR #2038)\n faster integer polynomial factorization (PR #2148)\n Euler-Descartes method for quartic equations (PR #1947)\n algebraic operations on tensors (PR #1700)\n tensor canonicalization (PR #1644)\n Handle the simplification of summations and products over a\n \ KroneckerDelta.\n Implemented LaTeX printing of DiracDelta, Heaviside, KroneckerDelta\n and LeviCivita, also many Matrix expressions.\n Improved LaTeX printing of fractions, Mul in general.\n IPython integration and printing issues have been ironed out.\n Stats now supports discrete distributions (e.g. Poisson) by\n relying on Summation objects\n Added DOT printing for visualization of expression trees\n Added information about solvability and nilpotency of named\n groups.\n" module: pkgsrc subject: 'CVS commit: pkgsrc/math/py-sympy' unixtime: '1390293484' user: wiz