np.leg2poly() method is used to convert a legendre series to a polynomial.
Syntax :
np.leg2poly(c)
Parameters:
c :[array_like] 1-D arrays of legendre series coefficients ordered from low to high.Return : [ndarray] 1-D array containing the coefficients of the equivalent polynomial.
Code #1 :
# Python program explaining # numpy.leg2poly() method # importing numpy as np # and numpy.polynomial.legendre module as geek import numpy as np import numpy.polynomial.legendre as geek # Input legendre series coefficients c = np.array([0.1, 0.2, 0.3, 0.4, 0.5]) # using np.leg2poly() method res = geek.leg2poly(c) # Resulting equivalent polynomial series coefficient print (res) |
[ 0.1375 -0.4 -1.425 1. 2.1875]
Code #2 :
# Python program explaining # numpy.leg2poly() method # importing numpy as np # and numpy.polynomial.legendre module as geek import numpy as np import numpy.polynomial.legendre as geek # Input legendre series coefficients c = ( 1, 2, 3, 4, 5) # using np.leg2poly() method res = geek.leg2poly(c) # Resulting equivalent polynomial series coefficient print (res) |
[ 1.375 -4. -14.25 10. 21.875]
Recommended Posts:
- Python | Numpy numpy.resize()
- Python | Numpy numpy.transpose()
- Python | Numpy numpy.ndarray.__lt__()
- Python | Numpy numpy.ndarray.__gt__()
- Python | Numpy numpy.ndarray.__le__()
- Python | Numpy numpy.ndarray.__ge__()
- Python | Numpy numpy.ndarray.__eq__()
- Python | Numpy numpy.ndarray.__ne__()
- Python | Numpy numpy.ndarray.__neg__()
- Python | Numpy numpy.ndarray.__pos__()
- Python | Numpy numpy.ndarray.__truediv__()
- Python | Numpy numpy.ndarray.__mul__()
- Python | Numpy numpy.ndarray.__sub__()
- Python | Numpy numpy.ndarray.__add__()
- Python | Numpy numpy.ndarray.__floordiv__()
- Python | Numpy numpy.ndarray.__mod__()
- Python | Numpy numpy.ndarray.__invert__()
- Python | Numpy numpy.ndarray.__divmod__()
- Python | Numpy numpy.ndarray.__pow__()
- Python | Numpy numpy.ndarray.__rshift__()
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

