Related papers: General approach to function approximation
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
We study the best approximation problem: \[ \displaystyle \min_{\alpha\in \mathbb R^m}\max_{1\leq i\leq n}\left|y_i -\sum_{j=1}^m \alpha_j \Gamma_j ({\bf x}_i) \right|. \] Here: $\Gamma:=\left\{\Gamma_1,...,\Gamma_m\right\}$ is a list of…
In this paper, we describe an algorithm for approximating functions of the form $f(x)=\int_{a}^{b} x^{\mu} \sigma(\mu) \, d \mu$ over $[0,1]$, where $\sigma(\mu)$ is some signed Radon measure, or, more generally, of the form $f(x) =…
For a continuous function $f$ defined on a closed and bounded domain, there is at least one maximum and one minimum. First, we introduce some preliminaries which are necessary through the paper. We then present an algorithm, which is…
We consider functional equations (Cauchy's, Abel's and some other functional equations) and show that to find general solution of these equations is equivalent to establish that a space-transformation of a Brownian Motion by suitable…
The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma…
This essay contains three parts. The first part of essay focuses on the hypothesis of the functional semantic constructions (FSC-Hypothesis). This hypothesis explains that a language, a number, a money are the functional semantic…
The suitable basis functions for approximating periodic function are periodic, trigonometric functions. When the function is not periodic, a viable alternative is to consider polynomials as basis functions. In this paper we will point out…
Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
For any real sequence {c(n)} tending to infinity as n tends to infinity, this constructs a function f which is continuous and integrable, and such that for every nonzero x, limsup c(n) f(n x) is infinite.
We give a short introduction to Pade approximation (rational approximation to a function with close contact at one point) and to Hermite-Pade approximation (simultaneous rational approximation to several functions with close contact at one…
We present a new method for the reconstruction of rational functions through finite-fields sampling that can significantly reduce the number of samples required. The method works by exploiting all the independent linear relations among…
If a function $f$, acting on a Euclidean space $\mathbb{R}^n$, is "almost" orthogonally additive in the sense that $f(x+y)=f(x)+f(y)$ for all $(x,y)\in\bot\setminus Z$, where $Z$ is a "negligible" subset of the $(2n-1)$-dimensional manifold…
Similarity metric which is not positive definite, and present a general theorem which provides a large family of similarity metrics which are positive definite.
In this paper, we establish a generalized Taylor expansion of a given function $f$ in the form $\displaystyle{f(x) = \sum_{j=0}^m c_j^{\alpha,\rho}\left(x^\rho-a^\rho\right)^{j\alpha} + e_m(x)}$ \noindent with $m\in \mathbb{N}$,…
We prove the existence of entire functions that achieve universal approximations on certain countable sequences of translation operators .