Related papers: Development of linear functional arithmetic and it…
This is the first of two papers describing the process of fitting experimental data under interval uncertainty. Here I present the methodology, designed from the very beginning as an interval-oriented tool, meant to replace to the large…
This paper presents a novel set-based computing method, called interval superposition arithmetic, for enclosing the image set of multivariate factorable functions on a given domain. In order to construct such enclosures, the proposed…
The task of inferring logical formulas from examples has garnered significant attention as a means to assist engineers in creating formal specifications used in the design, synthesis, and verification of computing systems. Among various…
This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…
In this book we use only special types of intervals and introduce the notion of different types of interval linear algebras and interval vector spaces using the intervals of the form [0, a] where the intervals are from Zn or Z+ \cup {0} or…
We study the properties of the constructive linear programing problems. The parameters of linear functions in such problems are constructive real numbers. To solve such a problem is to find the optimal plan with the constructive real number…
This paper studies the Hardy-type inequalities on the discrete intervals. The first result is the variational formulas of the optimal constants. Using these formulas, one may obtain an approximating procedure and the known basic estimates…
Function approximation has been an indispensable component in modern reinforcement learning algorithms designed to tackle problems with large state spaces in high dimensions. This paper reviews recent results on error analysis for these…
Sometimes we obtain attractive results when associating facts to simple elements. The goal of this work is to introduce a possible alternative in the study of the dynamics of rational maps.
Many different types of fractional calculus have been defined, which may be categorised into broad classes according to their properties and behaviours. Two types that have been much studied in the literature are the Hadamard-type…
The focus of this article is the approximation of functions which are analytic on a compact interval except at the endpoints. Typical numerical methods for approximating such functions depend upon the use of particular conformal maps from…
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
In this paper, we study integral functionals defined on spaces of functions with values on general (non-separable) Banach spaces. We introduce a new class of integrands and multifunctions for which we obtain measurable selection results.…
We prove that any given function can be smoothly approximated by functions lying in the kernel of a linear operator involving at least one fractional component. The setting in which we work is very general, since it takes into account…
We consider a wide class of the discrete optimization problems with interval objective function. We give a generalization of the greedy algorithm for the problems. Using the algorithm, we obtain the set of all possible greedy solutions and…
A one-to-one continuous function from a triangle to itself is defined that has both interesting number theoretic and analytic properties. This function is shown to be a natural generalization of the classical Minkowski ?(x) function. It is…
This article addresses a fundamental problem faced by the ab initio community: the lack of an effective formalism for the rapid exploration and exchange of new methods. To rectify this, we introduce a novel, basis-set independent,…
This paper is devoted to investigating the sequence of some linear functionals in the space $BV$ of finite variation functions. We prove that under certain conditions this sequence is bounded. We also prove that this result is sharp. In…
Functional data analysis is ubiquitous in most areas of sciences and engineering. Several paradigms are proposed to deal with the dimensionality problem which is inherent to this type of data. Sparseness, penalization, thresholding, among…
Functional data analysis is typically conducted within the $L^2$-Hilbert space framework. There is by now a fully developed statistical toolbox allowing for the principled application of the functional data machinery to real-world problems,…