The current paper contributes a novel framework for solving a class of linear matrix differential equations. To do so, the operational matrix of the derivative based on the shifted Bernoulli polynomials together with the collocation method are exploited to reduce the main problem to system of linear matrix equations. An error estimation of presented method is provided. Numerical experiments are...

Alternative Legendre polynomials (ALPs) are used to approximate the solution of a class of nonlinear Volterra-Hammerstein integral equations. For this purpose, the operational matrices of integration and the product for ALPs are derived. Then, using the collocation method, the considered problem is reduced into a set of nonlinear algebraic equations. The error analysis of the method is given an...

In this paper‎, ‎first‎, ‎a numerical method is presented for solving a class of linear Fredholm integro-differential equation‎. ‎The operational matrix of derivative is obtained by introducing hybrid third kind Chebyshev polynomials and Block-pulse functions‎. ‎The application of the proposed operational matrix with tau method is then utilized to transform the integro-differential equations to...

Abstract. The main purpose of this paper is to prove an identity of symmetry for the Frobenius-Euler polynomials. It turns out that the recurrence relation and multiplication theorem for the Frobenius-Euler polynomials which discussed in [ K. Shiratani, S. Yamamoto, On a p-adic interpolation function for the Euler numbers and its derivatives, Memo. Fac. Sci. Kyushu University Ser.A, 39(1985), 1...

the current paper contributes a novel framework for solving a class of linear matrix differential equations. to do so, the operational matrix of the derivative based on the shifted bernoulli polynomials together with the collocation method are exploited to reduce the main problem to system of linear matrix equations. an error estimation of presented method is provided. numerical experiments are...

Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this method is the computation of the roots of a special type of class polynomials, called Hilbert polynomials. However, there are several polynomials, called class polynomials, which can be used in the CM method and have much s...