Related papers: Characterizing arbitrarily slow convergence in the…
In this paper we analyze the approximation of stable linear time-invariant systems, like the Hilbert transform, by sampling series for bandlimited functions in the Paley-Wiener space $\mathcal{PW}_{\pi}^{1}$. It is known that there exist…
We consider skew-symmetric operators on a Hilbert space and study m-accretive restrictions of their negative adjoints. Using the theory of boundary systems, we provide a full characterisation of all those m-accretive restrictions, linear…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…
An extension of the theory of General Relativity is proposed, based on pseudo-complex space-time coordinates. The new theory corresponds to the introduction of two, in general different, metrics which are connected through specific…
A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1973, Erd\H{o}s conjectured that one can find so-called `sparse' Steiner triple systems. Roughly speaking, the…
This article studies the weak convergence and associated Central Limit Theorem for blurring and nonblurring processes. Then, they are applied to the estimation of location parameter. Simulation studies show that the location estimation…
Singular perturbation theory plays a central role in the approximate solution of nonlinear differential equations. However, applying these methods is a subtle art owing to the lack of globally applicable algorithms. Inspired by the fact…
In 1965, Ron Douglas proved that if $X$ is a closed subspace of an $L^1$-space and $X$ is isometric to another $L^1$-space, then $X$ is the range of a contractive projection on the containing $L^1$-space. In 1977 Arazy-Friedman showed that…
In the framework of special relativity, all particles are point-like or string-like. This nature of particles has caused the divergence difficulties in quantum field, string and superstring theories. In the framework of special relativity,…
In the article (Rothleitner and Francis 2011 Metrologia 48 187-195) the correction due to the finite speed of light in absolute gravimeters is analyzed from the viewpoint of special relativity. The relativistic concepts eventually lead to…
Contraction theory for dynamical systems on Euclidean spaces is well-established. For contractive (resp. semi-contractive) systems, the distance (resp. semi-distance) between any two trajectories decreases exponentially fast. For partially…
Subsurface projection has become indispensable in studying the geometry of the mapping class group and the curve complex of a surface. When the subsurface is an annulus, this projection is sometimes called relative twisting. We give two…
In this paper, it is shown why Lorentz Transformation implies the general case where observed events are not necessarily in the inertia frame of any observer but assumes a special scenario when determining the length contraction and time…
Discrete sampling theorem is formulated that refers to discrete signals specified by a finite number of their samples and band-limited in a domain of a certain orthogonal transform. Conditions of the recoverability of such signals from…
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its…
We propose an optimization formulation for the simultaneous estimation of a latent variable and the identification of a linear continuous-time dynamic system, given a single input-output pair. We justify this approach based on Bayesian…
The approximation of tensors is important for the efficient numerical treatment of high dimensional problems, but it remains an extremely challenging task. One of the most popular approach to tensor approximation is the alternating least…
A short and elementary proof of the joint convexity of relative entropy is presented, using nothing beyond linear algebra. The key ingredients are an easily verified integral representation and the strategy used to prove the Cauchy-Schwarz…