Results 11 to 20 of about 1,239,411 (205)
Illumination by Taylor polynomials [PDF]
Let f(x) be a differentiable function on the real line ℝ, and let P be a point not on the graph of f(x). Define the illumination index of P to be the number of distinct tangents to the graph of f which pass through P.
Alan Horwitz
doaj +5 more sources
NN-Poly: Approximating common neural networks with Taylor polynomials to imbue dynamical system constraints. [PDF]
Recent advances in deep learning have bolstered our ability to forecast the evolution of dynamical systems, but common neural networks do not adhere to physical laws, critical information that could lead to sounder state predictions.
Zhu F, Jing D, Leve F, Ferrari S.
europepmc +2 more sources
Formal Verification of Medina's Sequence of Polynomials for Approximating Arctangent [PDF]
The verification of many algorithms for calculating transcendental functions is based on polynomial approximations to these functions, often Taylor series approximations. However, computing and verifying approximations to the arctangent function are very
Ruben Gamboa, John Cowles
doaj +4 more sources
Abel universal functions: boundary behaviour and Taylor polynomials [PDF]
A holomorphic function f on the unit disc \mathbb{D} belongs to the class \mathcal{U}_{A} (\mathbb{D}) of Abel universal functions if the family \{f_{r}: 0\leq ...
S. Charpentier +2 more
semanticscholar +6 more sources
Subclasses of analytic and bi-univalent functions have been extensively improved and utilized for estimating the Taylor–Maclaurin coefficients and the Fekete–Szegö functional.
Abdulmtalb Hussen, Abdelbaset Zeyani
doaj +3 more sources
Hermite Subdivision Schemes and Taylor Polynomials [PDF]
We propose a general study of the convergence of a Hermite subdivision scheme ℋ of degree d>0 in dimension 1. This is done by linking Hermite subdivision schemes and Taylor polynomials and by associating a so-called Taylor subdivision (vector) scheme ...
S. Dubuc, Jean-Louis Merrien
semanticscholar +5 more sources
Taylor Polynomials of Rational Functions
A Taylor variety consists of all fixed order Taylor polynomials of rational functions, where the number of variables and degrees of numerators and denominators are fixed. In one variable, Taylor varieties are given by rank constraints on Hankel matrices. Inversion of the natural parametrization is known as Padé approximation. We study the dimension and
Conca, Aldo +3 more
openaire +5 more sources
This paper proposes an accurate numerical approach for computing the solution of two-dimensional fractional Volterra integral equations. The operational matrices of fractional integration based on the Hybridization of block-pulse and Taylor polynomials ...
Davood Jabari Sabegh +4 more
doaj +3 more sources
NON-ARCHIMEDEAN YOMDIN–GROMOV PARAMETRIZATIONS AND POINTS OF BOUNDED HEIGHT
We prove an analog of the Yomdin–Gromov lemma for $p$-adic definable sets and more broadly in a non-Archimedean definable context. This analog keeps track of piecewise approximation by Taylor polynomials, a nontrivial aspect in the totally disconnected ...
RAF CLUCKERS +2 more
doaj +3 more sources
Means and non-real Intersection Points of Taylor Polynomials [PDF]
Suppose that f has continuous derivatives thru order r+1 for x>0, and let P_{c} denote the Taylor polynomial to f of order r at x=c,c>0. In a previous paper of the author, it was shown that if r is an odd whole number and the (r+1)st derivative of f is ...
Horwitz, Alan
core +3 more sources

