a RG5d'@s$dZddlmZddlmZddlmZmZmZm Z m Z ddl m Z m Z ddlmZddlmZmZddlmZd d Zed-d dZddZd.ddZddZed/ddZddZed0ddZddZed1ddZdd Zed2d!d"Z d#d$Z!ed3d%d&Z"d'd(Z#d)d*Z$d4d+d,Z%d S)5z;Efficient functions for generating orthogonal polynomials. )Dummy)construct_domain)dup_muldup_mul_ground dup_lshiftdup_subdup_add)ZZQQ)DMP)PolyPurePoly)publicc Cs|jg|||d|d|||dgg}td|dD]F}||||||||d||d}|||d||j|||||d|}|||d||j|||d||d|||d||d|}|||j|||j|||d||} t|d||} tt|dd|||} t|d| |} |tt| | || |q>||S)z0Low-level implementation of Jacobi polynomials. )onerangerrappendrr) nabKseqidenf0f1f2p0p1p2r#R/var/www/html/django/DPS/env/lib/python3.9/site-packages/sympy/polys/orthopolys.py dup_jacobis006V4r%NFcCs~|dkrtd|t||gdd\}}ttt||d|d||}|dur^t||}nt|td}|rv|S| S)aGenerates Jacobi polynomial of degree `n` in `x`. Parameters ========== n : int `n` decides the degree of polynomial a Lower limit of minimal domain for the list of coefficients. b Upper limit of minimal domain for the list of coefficients. x : optional polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. rz.Cannot generate Jacobi polynomial of degree %sTfieldrNx) ValueErrorrr r%intr newr ras_expr)rrrr(polysrvpolyr#r#r$ jacobi_poly s  r0c Cs|jg|d||jgg}td|dD]t}|d|||j|}||d||d|}tt|dd|||}t|d||}|t|||q(||S)z4Low-level implementation of Gegenbauer polynomials. rrrrrzerorrrrr) rrrrrrrr!r"r#r#r$dup_gegenbauerBsr3cCsp|dkrtd|t|dd\}}ttt||||}|durPt||}nt|td}|rh|S| S)akGenerates Gegenbauer polynomial of degree `n` in `x`. Parameters ========== n : int `n` decides the degree of polynomial x : optional a Decides minimal domain for the list of coefficients. polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. rz2Cannot generate Gegenbauer polynomial of degree %sTr&Nr() r)rr r3r*r r+r rr,)rrr(r-rr/r#r#r$gegenbauer_polyPsr4cCsb|jg|j|jgg}td|dD]6}tt|dd||d|}|t||d|q"||S)zCLow-level implementation of Chebyshev polynomials of the 1st kind. rrrrr1rrrrrr#r#r$dup_chebyshevtos r6cCs^|dkrtd|ttt|tt}|dur>t||}nt|td}|rV|S| S)a1Generates Chebyshev polynomial of the first kind of degree `n` in `x`. Parameters ========== n : int `n` decides the degree of polynomial x : optional polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. rz:Cannot generate 1st kind Chebyshev polynomial of degree %sNr() r)r r6r*r r r+r rr,rr(r-r/r#r#r$chebyshevt_polyzsr8cCsd|jg|d|jgg}td|dD]6}tt|dd||d|}|t||d|q$||S)zCLow-level implementation of Chebyshev polynomials of the 2nd kind. rrrrr1r5r#r#r$dup_chebyshevus r9cCs^|dkrtd|ttt|tt}|dur>t||}nt|td}|rV|S| S)a2Generates Chebyshev polynomial of the second kind of degree `n` in `x`. Parameters ========== n : int `n` decides the degree of polynomial x : optional polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. rz:Cannot generate 2nd kind Chebyshev polynomial of degree %sNr() r)r r9r*r r r+r rr,r7r#r#r$chebyshevu_polysr:cCs||jg|d|jgg}td|dD]N}t|dd|}t|d||d|}tt||||d|}||q$||S)z1Low-level implementation of Hermite polynomials. rrrr)rr2rrrrr)rrrrrrcr#r#r$ dup_hermites r<cCs^|dkrtd|ttt|tt}|dur>t||}nt|td}|rV|S| S)aGenerates Hermite polynomial of degree `n` in `x`. Parameters ========== n : int `n` decides the degree of polynomial x : optional polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. rz/Cannot generate Hermite polynomial of degree %sNr() r)r r<r*r r r+r rr,r7r#r#r$ hermite_polys r=cCs|jg|j|jgg}td|dD]V}tt|dd||d|d||}t|d||d||}|t|||q"||S)z2Low-level implementation of Legendre polynomials. rrrrr1)rrrrrrr#r#r$ dup_legendres &r>cCs^|dkrtd|ttt|tt}|dur>t||}nt|td}|rV|S| S)aGenerates Legendre polynomial of degree `n` in `x`. Parameters ========== n : int `n` decides the degree of polynomial x : optional polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. rz0Cannot generate Legendre polynomial of degree %sNr() r)r r>r*r r r+r rr,r7r#r#r$ legendre_polys r?cCs|jg|jgg}td|dD]n}t|d|j ||||d|d|g|}t|d||||d||}|t|||q|dS)z2Low-level implementation of Laguerre polynomials. rrrr)r2rrrrrr)ralpharrrrrr#r#r$ dup_laguerres 4$rAcCs|dkrtd||dur.t|dd\}}nttd}}ttt||||}|durht||}nt|t d}|r|S| S)amGenerates Laguerre polynomial of degree `n` in `x`. Parameters ========== n : int `n` decides the degree of polynomial x : optional alpha Decides minimal domain for the list of coefficients. polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. rz0Cannot generate Laguerre polynomial of degree %sNTr&r() r)rr r rAr*r r+r rr,)rr(r@r-rr/r#r#r$ laguerre_polys  rBcCsr|jg|j|jgg}td|dD]>}tt|dd||d|d|}|t||d|q"t||d|S)z& Low-level implementation of fn(n, x) rrrrr1r5r#r#r$dup_spherical_bessel_fn@s $rCcCsj|j|jg|jgg}td|dD]>}tt|dd||dd||}|t||d|q"||S)z' Low-level implementation of fn(-n, x) rrrrr1r5r#r#r$dup_spherical_bessel_fn_minusKs $rEcCsp|dkrtt| t}ntt|t}t|t}|durLt|d|}nt|dtd}|rh|S| S)a  Coefficients for the spherical Bessel functions. Those are only needed in the jn() function. The coefficients are calculated from: fn(0, z) = 1/z fn(1, z) = 1/z**2 fn(n-1, z) + fn(n+1, z) == (2*n+1)/z * fn(n, z) Parameters ========== n : int `n` decides the degree of polynomial x : optional polys : bool, optional ``polys=True`` returns an expression, otherwise (default) returns an expression. Examples ======== >>> from sympy.polys.orthopolys import spherical_bessel_fn as fn >>> from sympy import Symbol >>> z = Symbol("z") >>> fn(1, z) z**(-2) >>> fn(2, z) -1/z + 3/z**3 >>> fn(3, z) -6/z**2 + 15/z**4 >>> fn(4, z) 1/z - 45/z**3 + 105/z**5 rNrr() rEr*r rCr r r+r rr,)rr(r-dupr/r#r#r$spherical_bessel_fnVs' rG)NF)NF)NF)NF)NF)NF)NNF)NF)&__doc__sympy.core.symbolrsympy.polys.constructorrsympy.polys.densearithrrrrrsympy.polys.domainsr r sympy.polys.polyclassesr sympy.polys.polytoolsr r sympy.utilitiesrr%r0r3r4r6r8r9r:r<r=r>r?rArBrCrErGr#r#r#r$s<     !          #