Related papers: Arithmetic, interpolation and factorization of ama…

We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…

The Euclidean Algorithm is the often forgotten key to rational approximation techniques, including Taylor, Lagrange, Hermite, osculating, cubic spline, Chebyshev, Pade and other interpolation schemes. A unified view of these various…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

The goal of the paper is to consider Bernstein-Mellin subspaces in the Lebesgue-Mellin spaces and establishing for functions in these subspaces new sampling theorems and Riesz-Boas high-order interpolation formulas.

In this article, the authors study the interpolation of Morrey-Campanato spaces and some smoothness spaces based on Morrey spaces, e.\,g., Besov-type and Triebel-Lizorkin-type spaces. Various interpolation methods, including the complex…

This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a…

We study the spatial discretization of Westervelt's quasilinear strongly damped wave equation by piecewise linear finite elements. Our approach employs the Banach fixed-point theorem combined with a priori analysis of a linear wave model…

The symmetric decreasing rearrangement of functions on $\mathbb{R}^n$ features in several seminal inequalities, such as the P\'olya-Szeg\H{o} inequality. The latter was shown by the authors to hold for all smoothing rearrangements, a class…

The inverse scattering problem for biharmonic waves, governing flexural vibrations of elastic plates, presents fundamental analytical challenges distinct from acoustic inverse problems due to the fourth-order differential operator and…

We denote by $\bbt$ the unit circle and by $\bbd$ the unit disc of $\bbc$. Let $s$ be a non-negative real and $\omega$ a weight such that $\omega(n) = (1+n)^{s} \quad (n \geq 0)$ and such that the sequence $\dsp…

Immersed boundary methods are high-order accurate computational tools used to model geometrically complex problems in computational mechanics. While traditional finite element methods require the construction of high-quality boundary-fitted…

Let $A$ and $B$ be sectorial operators in a Banach space $X$ of angles $\omega_A$ and $\omega_B$, respectively, where $\omega_A+\omega_B<\pi$. We present a simple and common approach to results on closedness of the operator sum $A+B$, based…

The problem of finding a solution of nonlinear inclusion problems in Banach space is considered in this paper. Using convex optimization techniques introduced by Robinson (Numer. Math., Vol. 19, 1972, pp. 341-347), a robust convergence…

Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…

The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…

The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…

We present an accelerated, or 'look-ahead' version of the Newton-Dinkelbach method, a well-known technique for solving fractional and parametric optimization problems. This acceleration halves the Bregman divergence between the current…

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

Block majorization-minimization (BMM) is a simple iterative algorithm for constrained nonconvex optimization that sequentially minimizes majorizing surrogates of the objective function in each block while the others are held fixed. BMM…

We solve an interpolation problem in $A^p_\alpha$ involving specifying a set of (possibly not distinct) $n$ points, where the $k^{\textrm{th}}$ derivative at the $k^{\textrm{th}}$ point is up to a constant as large as possible for functions…