Programming Articles - Page 546 of 2501

Evaluate a 2D Laguerre series at points (x,y) with 3D array of coefficients in Python

AmitDiwan
Updated on 04-Mar-2022 07:00:42

152 Views

To evaluate a 2D Laguerre series at points x, use the polynomial.laguerre.lagval2d() method in Python Numpy. The method returns the values of the two dimensional polynomial at points formed with pairs of corresponding values from x and y.The 1st parameter is x, y. The two dimensional series is evaluated at the points (x, y), where x and y must have the same shape. If x or y is a list or tuple, it is first converted to an ndarray, otherwise it is left unchanged and if it isn’t an ndarray it is treated as a scalar.The 2nd parameter, C, is ... Read More

C++ Program to find minimum possible ugliness we can achieve of towers

Arnab Chakraborty
Updated on 04-Mar-2022 07:09:47

220 Views

Suppose we have an array A with n elements. Consider there are n block towers in a row. The ith tower has height A[i]. In a single day, we can perform the operation: Select two indices i and j (i != j) and move back from tower i to j. It will decrease A[i] by 1 and increase A[j] by 1. The ugliness of the buildings is max(A) − min(A). We have to find the minimum possible ugliness we can achieve.So, if the input is like A = [1, 2, 3, 1, 5], then the output will be 1, because ... Read More

Generate a Vandermonde matrix of the Hermite polynomial with float array of points in Python

AmitDiwan
Updated on 04-Mar-2022 06:54:59

178 Views

To generate a Vandermonde matrix of the Hermite polynomial, use the chebyshev.hermvander() in Python Numpy. The method returns the pseudo-Vandermonde matrix. The shape of the returned matrix is x.shape + (deg + 1, ), where The last index is the degree of the corresponding Hermite polynomial. The dtype will be the same as the converted x.The parameter, x returns an Array of points. The dtype is converted to float64 or complex128 depending on whether any of the elements are complex. If x is scalar it is converted to a 1-D array. The parameter, deg is the degree of the resulting ... Read More

Generate a Vandermonde matrix of the Hermite polynomial in Python

AmitDiwan
Updated on 04-Mar-2022 06:50:01

324 Views

To generate a Vandermonde matrix of the Hermite polynomial, use the hermite.hermvander() in Python Numpy. The method returns the pseudo-Vandermonde matrix. The shape of the returned matrix is x.shape + (deg + 1, ), where The last index is the degree of the corresponding Hermite polynomial. The dtype will be the same as the converted x.The parameter, x returns an Array of points. The dtype is converted to float64 or complex128 depending on whether any of the elements are complex. If x is scalar it is converted to a 1-D array. The parameter, deg is the degree of the resulting ... Read More

C++ Program to find room status after checking guest appearance record

Arnab Chakraborty
Updated on 04-Mar-2022 07:06:54

372 Views

Suppose we have a string S with 'L', 'R' and digits from 0 to 9. Consider there is a hotel with 10 rooms they are numbered from 0 to 9, from left to right. The hotel has two entrances-one from the left side, and another from the right side. When a customer arrives to the hotel through the left entrance, they get an empty room closest to the left entrance. Similarly, when a customer arrives at the hotel through the right entrance, they get an empty room closest to the right entrance. But we have lost the room assignment list. ... Read More

Compute the roots of a Hermite series with given complex roots in Python

AmitDiwan
Updated on 04-Mar-2022 06:48:09

216 Views

To compute the roots of a Hermite series., use the hermite.hermroots() method in Python Numpy. The method returns an array of the roots of the series. If all the roots are real, then out is also real, otherwise it is complex. The parameter, c is a 1-D array of coefficients.The root estimates are obtained as the eigenvalues of the companion matrix, Roots far from the origin of the complex plane may have large errors due to the numerical instability of the series for such values. Roots with multiplicity greater than 1 will also show larger errors as the value of ... Read More

Compute the roots of a Hermite series in Python

AmitDiwan
Updated on 04-Mar-2022 06:46:12

217 Views

To compute the roots of a Hermite series., use the hermite.hermroots() method in Python Numpy. The method returns an Array of the roots of the series. If all the roots are real, then out is also real, otherwise it is complex. The parameter, c is a 1-D array of coefficients.The root estimates are obtained as the eigenvalues of the companion matrix, Roots far from the origin of the complex plane may have large errors due to the numerical instability of the series for such values. Roots with multiplicity greater than 1 will also show larger errors as the value of ... Read More

Evaluate a Laguerre series at multidimensional array of points x in Python

AmitDiwan
Updated on 04-Mar-2022 06:44:38

176 Views

To evaluate a Laguerre series at multi-dimensional array of points x, use the polynomial.laguerre.lagval() method in Python Numpy. The 1st parameter is x. If x is a list or tuple, it is converted to an ndarray, otherwise it is left unchanged and treated as a scalar. In either case, x or its elements must support addition and multiplication with themselves and with the elements of c.The 2nd parameter, C, an array of coefficients ordered so that the coefficients for terms of degree n are contained in c[n]. If c is multidimensional the remaining indices enumerate multiple polynomials. In the two ... Read More

C++ Program to find winner name of stick crossing game

Arnab Chakraborty
Updated on 04-Mar-2022 06:46:42

297 Views

Suppose we have two numbers n and k. Amal and Bimal are playing a game. The rules are simple. Amal draws n sticks in a row. After that the players take turns crossing out exactly k sticks from left or right in each turn. Amal starts the game. If there are less than k sticks on the paper before some turn, the game ends. Amal wins if he makes strictly more moves than Bimal. We have to find who will be the winner.So, if the input is like n = 10; k = 4, then the output will be Bimal. ... Read More

Evaluate a Laguerre series at array of points x in Python

AmitDiwan
Updated on 04-Mar-2022 06:42:54

168 Views

To evaluate a Laguerre series at array of points x, use the polynomial.laguerre.lagval() method in Python Numpy. The 1st parameter is x. If x is a list or tuple, it is converted to an ndarray, otherwise it is left unchanged and treated as a scalar. In either case, x or its elements must support addition and multiplication with themselves and with the elements of c.The 2nd parameter, C, an array of coefficients ordered so that the coefficients for terms of degree n are contained in c[n]. If c is multidimensional the remaining indices enumerate multiple polynomials. In the two dimensional ... Read More

Advertisements