Related papers: A new realization of rational functions, with appl…
Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…
This paper focuses on the problem of reconstructing a vector of rational functions given some evaluations, or more generally given their remainders modulo different polynomials. The special case of rational functions sharing the same…
If $\fA$ is a unital weak-$*$ closed algebra of multiplication operators on a reproducing kernel Hilbert space which has the property $\bA_1(1)$, then the cyclic invariant subspaces index a Nevanlinna-Pick family of kernels. This yields an…
We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…
Let $f$ be a holomorphic function on the strip $\{z\in C: -\alpha<Im z<\alpha\}, \alpha > 0$, belonging to the class $H(\alpha,-\alpha;\epsilon)$ defined below. It is shown that there exist holomorphic functions $w_1$ on $\{z\in C: 0<Im z…
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…
In this paper, we introduce a set representation called polynomial logical zonotopes for performing exact and computationally efficient reachability analysis on logical systems. We prove that through this polynomial-like construction, we…
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…
We propose new optimal estimators for the Lipschitz frontier of a set of points. They are defined as kernel estimators being sufficiently regular, covering all the points and whose associated support is of smallest surface. The estimators…
Based on symmetry principles, we derive a fusion algebra generated from repeated fusions of the irreducible modules appearing in the W-extended logarithmic minimal model WLM(p,p'). In addition to the irreducible modules themselves, closure…
Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…
We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…
A \Riesz-basis sequence for $L_2[-\pi,\pi]$ is a strictly increasing sequence $X:=(x_j)_{j\in\mathbb{Z}}$ in $\mathbb{R}$ such that the set of functions $\left(e^{-ix_j(\cdot)}\right)_{j\in\mathbb{Z}}$ is a Riesz basis for $L_2[-\pi,\pi]$.…
We consider sequences of rational interpolants $r_n(z)$ of degree $n$ to the exponential function $e^z$ associated to a triangular scheme of complex points $\{z_{j}^{(2n)}\}_{j=0}^{2n}$, $n>0$, such that, for all $n$, $|z_{j}^{(2n)}|\leq…
Given a "black box" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine…
Recently we developed a new sampling methodology based on incomplete cosine expansion of the sinc function and applied it in numerical integration in order to obtain a rational approximation for the complex error function $w\left(z \right)…
A general interpolation problem with operator argument is studied for functions f from the de Branges-Rovnyak space H(s) associated with an analytic function s mapping the open unit disk D into the closed unit disk. The interpolation…
Primal-dual algorithms are frequently used for iteratively solving large-scale convex optimization problems. The analysis of such algorithms is usually done on a case-by-case basis, and the resulting guaranteed rates of convergence can be…
For any rational functions with complex coefficients $A(z), B(z)$ and $C(z)$, where $A(z)$, $C(z)$ are not identically zero, we consider the sequence of rational functions $H_{m}(z)$ with generating function $\sum…
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda + \sum_{k = 1}^d [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are linear forms in…