Results 21 to 30 of about 1,508,171 (301)
Hermite Subdivision Schemes and Taylor Polynomials [PDF]
The authors propose a general study of the convergence of a Hermite subdivision scheme \(\mathcal H\) of degree \(d>0\) in dimension \(1\). Under the spectral condition, authors transform the Hermite subdivision scheme \(\mathcal H\) into the Taylor subdivision scheme \(\mathcal S\).
Dubuc, Serge, Merrien, Jean-Louis
openaire +4 more sources
Horadam Polynomials and a Class of Biunivalent Functions Defined by Ruscheweyh Operator
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
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
A numerical method for solving continuous population models for single and interacting species
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
We present the first message of the cycle from two articles where the rearrangement of the order of approximation of the matrix method of numerical integration depending on the degree in the Taylor’s polynomial expansion of solutions of boundary value ...
Vladimir N Maklakov
doaj +1 more source
The paper considers the previously proposed method of numerical integration using the matrix calculus in the study of boundary value problems for nonhomogeneous linear ordinary differential equations of the second order with variable coefficients ...
Vladimir N. Maklakov
doaj +1 more source
Sharp Taylor Polynomial Enclosures in One Dimension
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 +3 more sources
α‐Synuclein Forms Distinct Micelle‐Like Assemblies at Low Ionic Strengths
At high ionic strength, α‐synuclein forms diverse assemblies, including oligomers, fibrils, and condensates. Here, we show that at low ionic strength, α‐synuclein adopts a distinct, low‐abundance assembly state. These assemblies maintain a constant size above a critical concentration and do not coalesce, suggesting a micelle‐like organization ...
Sophie Hertel +10 more
wiley +1 more source
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
ABSTRACT This paper examines the determinants of generative AI (GenAI) knowledge and usage among agricultural extension professionals. Drawing on survey data from agricultural extension personnel in Tennessee, we employ regression analyses and latent Dirichlet allocation (LDA) for topic modeling of open‐ended responses to study the knowledge and usage ...
Abdelaziz Lawani +3 more
wiley +1 more source

