Results 21 to 30 of about 4,240 (200)

Taylor collocation method for systems of high-order linear differential–difference equations with variable coefficients

Ain Shams Engineering Journal, 2013
A Taylor collocation method has been developed to solve the systems of high-order linear differential–difference equations in terms of the Taylor polynomials.
Elçin Gökmen, Mehmet Sezer
doaj   +1 more source

Summation identities involving certain classes of polynomials [PDF]

, 2013
In some recent investigations involving differential operators for a general family of Lagrange polynomials, Chen et al. [Some new results for the Lagrange polynomials in several variables, ANZIAM J. 49 (2007), pp.
Shuoh-Jung Liu; Shy-Der Lin; Chen, Kung-yu; H. M. Srivastava, H. M. Srivastavac   +1 more
core   +1 more source

Polynomial approach for the most general linear Fredholm integrodifferential-difference equations using Taylor matrix method

International Journal of Mathematics and Mathematical Sciences, 2006
A Taylor matrix method is developed to find an approximate solution of the most general linear Fredholm integrodifferential-difference equations with variable coefficients under the mixed conditions in terms of Taylor polynomials.
Mehmet Sezer, Mustafa Gülsu
doaj   +1 more source

Polynomial extensions of the Milliken-Taylor Theorem [PDF]

Transactions of the American Mathematical Society, 2014
Summary: \textit{Milliken-Taylor systems} are some of the most general infinitary configurations that are known to be partition regular. These are sets of the form \(\mathrm{MT}(\langle a_i\rangle _{i=1}^m,\langle x_n\rangle _{n=1}^\infty )= \{\sum _{i=1}^m a_i\sum _{t\in F_i}\,x_t:F_1,F_2,\ldots , F_m\) are increasing finite nonempty subsets of ...
Bergelson, Vitaly, Hindman, Neil, Williams, Kendall   +2 more
openaire   +1 more source

Horadam Polynomials and a Class of Biunivalent Functions Defined by Ruscheweyh Operator

International Journal of Mathematics and Mathematical Sciences, 2023
In this paper, we introduce and investigate a class of biunivalent functions, denoted by Hn,r,α, that depends on the Ruscheweyh operator and defined by means of Horadam polynomials.
Waleed Al-Rawashdeh
doaj   +1 more source

Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs

Discussiones Mathematicae Graph Theory, 2022
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney’s broken cycle theorem for hypergraphs, as well as deriving an explicit ...
Durhuus Bergfinnur, Lucia Angelo
doaj   +1 more source

Taylor Meshless Method for bending and buckling of thin plates [PDF]

, 2017
This paper introduces a new meshless method named Taylor Meshless Method (TMM) using Taylor series to deduce the shape functions. Next the problem is discretized by point-collocation only on the boundary and without integration.
POTIER-FERRY, Michel, ABED-MERAIM, Farid, TIAN, Haitao   +2 more
core   +1 more source

A numerical method for solving continuous population models for single and interacting species

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2019
In thisstudy, a numerical approach is presented to obtain the approximate solutions ofcontinuous population models for single and interacting species.
Elçin Gökmen, Elçin Çelik
doaj   +1 more source

Estimation of the order of the matrix method approximation of numerical integration of boundary-value problems for the second order inhomogeneous linear ordinary differential equations

Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2014
Using the first three terms of Taylor expansion of the required function in the approximate derivative by finite differences leads to the second order approximation of the traditional numerical quadrature method of boundary value problems for linear ...
Vladimir N Maklakov
doaj   +1 more source

Sharp Taylor Polynomial Enclosures in One Dimension

CoRR, 2023
It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range of the $k$th derivative over the trust region, but this produces suboptimal bounds.
Matthew Streeter, Joshua V. Dillon
openaire   +2 more sources