نتایج جستجو برای: chebyshevs polynomials
تعداد نتایج: 37865 فیلتر نتایج به سال:
In this study a numerical method is developed to solve the Hammerstein integral equations. To this end the kernel has been approximated using the leastsquares approximation schemes based on Legender-Bernstein basis. The Legender polynomials are orthogonal and these properties improve the accuracy of the approximations. Also the nonlinear unknown function has been approximated by using the Berns...
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
The main purpose of this paper is to find fuzzy root of fuzzy polynomials (if exists) by using Newton-Raphson method. The proposed numerical method has capability to solve fuzzy polynomials as well as algebric ones. For this purpose, by using parametric form of fuzzy coefficients of fuzzy polynomial and Newton-Rphson method we can find its fuzzy roots. Finally, we illustrate our approach by nu...
in this article we implement an operational matrix of fractional integration for legendre polynomials. we proposed an algorithm to obtain an approximation solution for fractional differential equations, described in riemann-liouville sense, based on shifted legendre polynomials. this method was applied to solve linear multi-order fractional differential equation with initial conditions, and the...
Comparative study on solving fractional differential equations via shifted Jacobi collocation method
In this paper, operational matrices of Riemann-Liouville fractional integration and Caputo fractional differentiation for shifted Jacobi polynomials are considered. Using the given initial conditions, we transform the fractional differential equation (FDE) into a modified fractional differential equation with zero initial conditions. Next, all the existing functions in modified differential equ...
In this paper, we are intend to present a numerical algorithm for computing approximate solution of linear and nonlinear Fredholm, Volterra and Fredholm-Volterra integro-differential equations. The approximated solution is written in terms of fractional Jacobi polynomials. In this way, firstly we define Riemann-Liouville fractional operational matrix of fractional order Jacobi polynomials, the...
in this paper, we introduce hybrid of block-pulse functions and bernstein polynomials and derive operational matrices of integration, dual, differentiation, product and delay of these hybrid functions by a general procedure that can be used for other polynomials or orthogonal functions. then, we utilize them to solvedelay differential equations and time-delay system. the method is based upon ex...
In this paper we intend to offer new numerical methods to solvethe fuzzy Fredholm- Volterra integral equations of the firstkind $(FVFIE-1)$. Some examples are investigated to verify convergence results and to illustrate the efficiently of the methods.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید