Related papers: Approximately angle preserving mappings
Recently, a framework for the approximation of the entire set of $\epsilon$-efficient solutions (denote by $E_\epsilon$) of a multi-objective optimization problem with stochastic search algorithms has been proposed. It was proven that such…
We present an overview to the approximation property, paying especial attention to the recent results relating the approximation property to ideals of linear operators and Lipschitz ideals. We complete the paper with some new results on…
The eccentricity (anti-adjacency) matrix $\varepsilon(G)$ of a graph $G$ is obtained from the distance matrix by retaining the eccentricities in each row and each column. This matrix is first defined in 2018 by Wang et al. \cite{1}. In this…
Let $A \in \mathbb{R}^{n \times n}$ be invertible, $x \in \mathbb{R}^n$ unknown and $b =Ax $ given. We are interested in approximate solutions: vectors $y \in \mathbb{R}^n$ such that $\|Ay - b\|$ is small. We prove that for all $0<…
A continuous-time dynamical system with parameter $\varepsilon$ is nearly-periodic if all its trajectories are periodic with nowhere-vanishing angular frequency as $\varepsilon$ approaches 0. Nearly-periodic maps are discrete-time analogues…
In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…
The Macintosh application \textit{StdMap} allows easy exploration of many of the phenomena of area-preserving mappings. This tutorial explains some of these phenomena and presents a number of simple experiments centered on the use of this…
We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…
We introduce a generalization of the b-metric we call a (b,c)-metric. We show that if $X$ is a $(b,c)$-metric space and $\psi: X \longrightarrow Y$ is a quasi-isometry then $Y$ is $(b,c)$-metrizable. We also define a particular kind of…
Visualizing very large matrices involves many formidable problems. Various popular solutions to these problems involve sampling, clustering, projection, or feature selection to reduce the size and complexity of the original task. An…
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \emph{distance} function between $P$ and every $m$-substring of $T$. We consider a…
We consider bipartite graphs definable in o-minimal structures, in which the edge relation $G$ is a finite union of graphs of certain measure-preserving maps. We establish a fact on the existence of definable matchings with few short…
The optimal transport (OT) map offers the most economical way to transfer one probability measure distribution to another. Classical OT theory does not involve a discussion of preserving topological connections and orientations in…
In this paper, we present an approach to enhance and improve the current normal map rendering technique. Our algorithm is based on semi-discrete Optimal Mass Transportation (OMT) theory and has a solid theoretical base. The key difference…
Motivated by applications such as sparse PCA, in this paper we present provably-accurate one-pass algorithms for the sparse approximation of the top eigenvectors of extremely massive matrices based on a single compact linear sketch. The…
We expand upon work from many hands on the decomposition of nuclear maps. Such maps can be characterized by their ability to be approximately written as the composition of maps to and from matrices. Under certain conditions (such as…
In this short note, we provide a partial extension of Rivi\`ere's convervation law in higher dimensions under certain Lorentz integrability condition for the connection matrix. As an application, we obtain a conservation law for weakly…
In this short article, some properties of matrices of moving least-squares approximation have been proven.The used technique is based on singular-value decomposition and inequalities for singular-values. Some inequalities for the norm of…
We consider a general model for representing and manipulating parametric curves, in which a curve is specified by a black box mapping a parameter value between 0 and 1 to a point in Euclidean d-space. In this model, we consider the…
In a first objective we improve our understanding about surjective and bijective bounded linear operators preserving orthogonality from a JB$^*$-algebra $\mathcal{A}$ into a JB$^*$-triple $E$. Among many other conclusions, it is shown that…