Results 1 to 10 of about 1,527,858 (201)
Polynomial Approximation of Symmetric Functions [PDF]
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$ arguments.
M. Bachmayr, G. Dusson, C. Ortner
semanticscholar +4 more sources
Algorithms For Positive Polynomial Approximation [PDF]
We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute non negative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the ...
M. Pinto, F. Charles, B. Després
semanticscholar +3 more sources
Nonlinear electrocardiographic imaging using polynomial approximation networks [PDF]
Electrocardiography is a valuable tool to aid in medical understanding and treatment of heart-related ailments, specifically atrial fibrillation (AF) and other irregular cardiac behavior.
Abhejit Rajagopal +3 more
doaj +2 more sources
A polynomial approximation for arbitrary functions
6 pages, 1 ...
Can Ozan Tan
exaly +4 more sources
Data-Driven System Analysis of Nonlinear Systems Using Polynomial Approximation [PDF]
In the context of data-driven control of nonlinear systems, many approaches lack of rigorous guarantees, call for nonconvex optimization, or require knowledge of a function basis containing the system dynamics.
Tim Martin, F. Allgöwer
semanticscholar +1 more source
In this paper, we discuss the cone of copositive tensors and its approximation. We describe some basic properties of copositive tensors and positive semidefinite tensors. Specifically, we show that a non-positive tensor (or Z-tensor) is copositive if and
Muhammad Faisal Iqbal, Faizan Ahmed
doaj +1 more source
Consistency of Approximation of Bernstein Polynomial-Based Direct Methods for Optimal Control
Bernstein polynomial approximation of continuous function has a slower rate of convergence compared to other approximation methods. “The fact seems to have precluded any numerical application of Bernstein polynomials from having been made.
Venanzio Cichella +4 more
doaj +1 more source
On polynomial approximations to AC [PDF]
AbstractClassicalapproximation results show that anycircuit of sizeand depthhas an‐error probabilistic polynomial over the reals of degree. We improve this upper bound to, which is much better for small values of. We then use this result to show that‐wise independence foolscircuits of sizeand depthup to error at most, improving on Tal's strengthening ...
Prahladh Harsha +1 more
openaire +5 more sources
Mainstream math libraries for floating point (FP) do not produce correctly rounded results for all inputs. In contrast, CR-LIBM and RLIBM provide correctly rounded implementations for a specific FP representation with one rounding mode.
Jay P. Lim, Santosh Nagarakatte
semanticscholar +1 more source
On the Approximation of Entire Harmonic Functions in ℝn Having Slow Growth
The generalized growth of entire transcendental functions in terms of polynomial approximation errors in some Banach spaces has been studied by various authors.
Devendra Kumar, A. Ghareeb
doaj +1 more source

