Related papers: Interpolation and Amalgamation for Arrays with Max…
Microwave, submillimetre-wave, and far-infrared phased arrays are of considerable importance for astronomy. We consider the behaviour imaging phased arrays and interferometric phased arrays from a functional perspective. It is shown that…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
The convergence of DP Fourier series which are neither strongly convergent nor strongly divergent is discussed in terms of the Taylor series of the corresponding inner analytic functions. These are the cases in which the maximum disk of…
In this short note, we merge the areas of hypercomplex algebras with that of fractal interpolation and approximation. The outcome is a new holistic methodology that allows the modelling of phenomena exhibiting a complex self-referential…
We consider the problem of identity testing and recovering (that is, interpolating) of a "hidden" monic polynomials $f$, given an oracle access to $f(x)^e$ for $x\in\mathbb F_q$, where $\mathbb F_q$ is the finite field of $q$ elements and…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
We present a novel programming language design that attempts to combine the clarity and safety of high-level functional languages with the efficiency and parallelism of low-level numerical languages. We treat arrays as eagerly-memoized…
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…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
The purpose of this paper is to introduce into consideration an analogue of the concentration index in the class of subharmonic functions of infinite order. The one in the case of finite order is used in the interpolation theory.
We consider minimization of the sum of a large number of convex functions, and we propose an incremental aggregated version of the proximal algorithm, which bears similarity to the incremental aggregated gradient and subgradient methods…
Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…
The aim of this paper is to prove an improved version of the bounded differences inequality for matrix valued functions, by developing the methods of Mackey et al.: "Matrix Concentration Inequalities via the Method of Exchangeable Pairs".…
It is possible to perform some operations with extrafunctions applying these operations separately to each coordinate. Operations performed in this manner are called regular. It is proved that it is possible to extend several operations…
We give an alternative proof of a Marcinkiewicz interpolation theorem for non commutative maximal functions and positive maps, slightly refining earlier versions of the statement. The main novelty is that it provides a substitute for the…
This paper provides approximation orders for a class of nonlinear interpolation procedures for univariate data sampled over $\sigma$ quasi-uniform grids. The considered interpolation is built using both essentially nonoscillatory (ENO) and…
We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…
Theory interpolation has found several successful applications in model checking. We present a novel method for computing interpolants for ground formulas in the theory of equality. The method produces interpolants from colored congruence…
Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…
It is widely believed that complex machine learning models generally encode features through linear representations. This is the foundational hypothesis behind a vast body of work on interpretability. A key challenge toward extracting…