Results 31 to 40 of about 1,716,432 (375)
Mathematical approximator based on basic spline approximation [PDF]
The article considers the problem of constructing a mathematical piecewise linear approximator based on approximation by basis splines. An algorithm has been developed designed to implement a class of special functions and create parallel ...
Turdimatov Mamirjon +5 more
doaj +1 more source
Integration of a Generalized Ratio of Polynomials
This paper provides a closed-form solution to the indefinite integral of a ratio of generalized polynomials where the denominator polynomial is raised to the general order r∈Z+.
Matthew J. Brandsema, Donovan E. Brocker
doaj +1 more source
Tutte Polynomials and Link Polynomials [PDF]
We show how the Tutte polynomial of a plane graph can be evaluated as the "homfly" polynomial of an associated oriented link. Then we discuss some consequences for the partition function of the Potts model, the Four Color Problem and the time complexity of the computation of the homfly polynomial.
openaire +1 more source
Polynomial Distributions and Transformations
Polynomials are common algebraic structures, which are often used to approximate functions, such as probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of systems rather ...
Yue Yu, Pavel Loskot
doaj +1 more source
The taut polynomial and the Alexander polynomial
AbstractLandry, Minsky and Taylor defined the taut polynomial of a veering triangulation. Its specialisations generalise the Teichmüller polynomial of a fibred face of the Thurston norm ball. We prove that the taut polynomial of a veering triangulation is equal to a certain twisted Alexander polynomial of the underlying manifold.
openaire +2 more sources
Continuous monitoring of natural human gait in real-life environments is essential in many applications including disease monitoring, rehabilitation, and professional sports.
Erfan Shahabpoor, Aleksandar Pavic
doaj +1 more source
Polynomial reconstruction of the matching polynomial
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph.
Yongtang Shi, Xueliang Li, Martin Trinks
openaire +5 more sources
Polynomials biorthogonal to Appell's polynomials [PDF]
We present the solution of a long-standing problem, namely, the determination of a set of polynomials in two independent variables which are biorthogonal over a triangular region to a set of polynomials previously introduced by Appell. Some elementary properties of our polynomials are investigated.
R.A. Littler, Edward D. Fackerell
openaire +2 more sources
When is a trigonometric polynomial not a trigonometric polynomial? [PDF]
As an application of B\'ezout's theorem from algebraic geometry, we show that the standard notion of a trigonometric polynomial does not agree with a more naive, but reasonable notion of trigonometric polynomial.Comment: 3 ...
Borzellino, Joseph E., Sherman, Morgan
core +3 more sources
In this paper, new refinements and improvements of Jordan’s and Kober’s inequalities are presented. We give new polynomial bounds for the s i n c ( x ) and cos ( x ) functions based on the interpolation and approximation ...
Lina Zhang, Xuesi Ma
doaj +1 more source

